Unifying tree decompositions for reasoning in graphical models
Authors:
- 1 August 2005
- journal article
- Published by Elsevier in Artificial Intelligence
- Vol. 166 (1-2) , 165-193
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- A general scheme for automatic generation of search heuristics from specification dependencies☆☆Preliminary versions of this paper were presented in [15,16,18]. This work was supported in part by NSF grant IIS-0086529 and by MURI ONR award N00014-00-1-0617.Artificial Intelligence, 2001
- Topological parameters for time-space tradeoffArtificial Intelligence, 2001
- A comparison of structural CSP decomposition methodsArtificial Intelligence, 2000
- Bucket elimination: A unifying framework for reasoningArtificial Intelligence, 1999
- Some improvements to the Shenoy-Shafer and Hugin architectures for computing marginalsArtificial Intelligence, 1998
- An algebra of bayesian belief universes for knowledge‐based systemsNetworks, 1990
- Tree clustering for constraint networksArtificial Intelligence, 1989
- Network-based heuristics for constraint-satisfaction problemsArtificial Intelligence, 1987
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A surveyBIT Numerical Mathematics, 1985
- On the Desirability of Acyclic Database SchemesJournal of the ACM, 1983