Reasoning with Probabilistic and Deterministic Graphical Models: Exact Algorithms
Author:
- Rina DechterRDRina Dechter
- 20 December 2013
- journal article
- Published by Springer Nature in Synthesis Lectures on Artificial Intelligence and Machine Learning
- Vol. 7 (3) , 1-191
Abstract
No abstract availableThis publication has 59 references indexed in Scilit:
- Belief propagation: technical perspectiveCommunications of the ACM, 2010
- Frontmatter2009
- AND/OR search spaces for graphical modelsArtificial Intelligence, 2007
- Unifying tree decompositions for reasoning in graphical modelsArtificial Intelligence, 2005
- Adopt: asynchronous distributed constraint optimization with quality guaranteesArtificial Intelligence, 2005
- Tree-based reparameterization framework for analysis of sum-product and related algorithmsIEEE Transactions on Information Theory, 2003
- A comparison of structural CSP decomposition methodsArtificial Intelligence, 2000
- Local and global relational consistencyTheoretical Computer Science, 1997
- Treewidth: Algorithmic techniques and results1997
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A surveyBIT Numerical Mathematics, 1985