Min-Max Message Passing and Local Consistency in Constraint Networks
暂无分享,去创建一个
[1] Peter Norvig,et al. Artificial Intelligence: A Modern Approach , 1995 .
[2] T. Toffoli. Physics and computation , 1982 .
[3] M. Mézard,et al. Random K-satisfiability problem: from an analytic solution to an efficient algorithm. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.
[4] Eugene C. Freuder. A Sufficient Condition for Backtrack-Free Search , 1982, JACM.
[5] William T. Freeman,et al. Understanding belief propagation and its generalizations , 2003 .
[6] W. Freeman,et al. Bethe free energy, Kikuchi approximations, and belief propagation algorithms , 2001 .
[7] Alan K. Mackworth. Consistency in Networks of Relations , 1977, Artif. Intell..
[8] Martin C. Cooper,et al. Tractable Constraints on Ordered Domains , 1995, Artif. Intell..
[9] Hong Xu,et al. The Nemhauser-Trotter Reduction and Lifted Message Passing for the Weighted CSP , 2017, CPAIOR.
[10] Peter van Beek,et al. On the minimality and global consistency of row-convex constraint networks , 1995, JACM.
[11] S. Stenholm. Information, Physics and Computation, by Marc Mézard and Andrea Montanari , 2010 .