Look-Ahead with Mini-Bucket Heuristics for MPE
暂无分享,去创建一个
[1] Rina Dechter,et al. Branch and Bound with Mini-Bucket Heuristics , 1999, IJCAI.
[2] Vincent Vidal,et al. A Lookahead Strategy for Heuristic Search Planning , 2004, ICAPS.
[3] Rina Dechter,et al. Memory intensive AND/OR search for combinatorial optimization in graphical models , 2009, Artif. Intell..
[4] Judea Pearl,et al. Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.
[5] Judea Pearl,et al. Probabilistic reasoning in intelligent systems , 1988 .
[6] Roni Stern,et al. A* with Lookahead Re-Evaluated , 2014, SOCS.
[7] R. Dechter,et al. Winning the PASCAL 2011 MAP Challenge with Enhanced AND / OR Branch-and-Bound , 2011 .
[8] Blai Bonet,et al. A Concise Introduction to Models and Methods for Automated Planning , 2013, A Concise Introduction to Models and Methods for Automated Planning.
[9] Rina Dechter,et al. A general scheme for automatic generation of search heuristics from specification dependencies , 2001, Artif. Intell..
[10] Nils J. Nilsson,et al. Principles of Artificial Intelligence , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[11] Lars Otten,et al. Join-graph based cost-shifting schemes , 2012, UAI.
[12] Rina Dechter. Reasoning with Probabilistic and Deterministic Graphical Models: Exact Algorithms , 2013, Reasoning with Probabilistic and Deterministic Graphical Models: Exact Algorithms.