Recent directions in netlist partitioning: a survey
Integration, the VLSI Journal
Multilevel hypergraph partitioning: applications in VLSI domain
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Artificial Intelligence - special issue on computational tradeoffs under bounded resources
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Exploiting causal independence in Bayesian network inference
Journal of Artificial Intelligence Research
Compiling knowledge into decomposable negation normal form
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Utilizing device behavior in structure-based diagnosis
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
Bucket elimination: a unifying framework for probabilistic inference
UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
An evaluation of structural parameters for probabilistic reasoning: results on benchmark circuits
UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
SampleSearch: Importance sampling in presence of determinism
Artificial Intelligence
On the structure of elimination trees for Bayesian network inference
MICAI'10 Proceedings of the 9th Mexican international conference on Artificial intelligence conference on Advances in soft computing: Part II
Decision making with multiple objectives using GAI networks
Artificial Intelligence
Adaptive Exact Inference in Graphical Models
The Journal of Machine Learning Research
Functional treewidth: bounding complexity in the presence of functional dependencies
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
| Hi-index | 0.00 |
Darwiche has recently proposed a graphical model for driving conditioning algorithms, called a dtree, which specifies a recursive decomposition of a directed acyclic graph (DAG) into its families. A main property of a dtree is its width, and it was shown previously how to convert a DAG elimination order of width w into a dtree of width ≤ w. The importance of this conversion is that any algorithm for constructing low-width elimination orders can be directly used for constructing low-width dtrees. We propose in this paper a more direct method for constructing dtrees based on hypergraph partitioning. This new method turns out to be quite competitive with existing methods in minimizing width. We also present methods for converting a dtree of width w into elimination orders and jointrees of no greater width. This leads to a new class of algorithms for generating elimination orders and jointrees (via recursive decomposition).