Optimizing exact genetic linkage computations
RECOMB '03 Proceedings of the seventh annual international conference on Research in computational molecular biology
Hybrid backtracking bounded by tree-decomposition of constraint networks
Artificial Intelligence
A Prototypical System for Soft Evidential Update
Applied Intelligence
A complete anytime algorithm for treewidth
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Intelligent light control using sensor networks
Proceedings of the 3rd international conference on Embedded networked sensor systems
Computing pure nash equilibria in graphical games via markov random fields
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Decomposition of structural learning about directed acyclic graphs
Artificial Intelligence
Local Propagation in Conditional Gaussian Bayesian Networks
The Journal of Machine Learning Research
On the maximum cardinality search lower bound for treewidth
Discrete Applied Mathematics
A Recursive Method for Structural Learning of Directed Acyclic Graphs
The Journal of Machine Learning Research
Solving problems on recursively constructed graphs
ACM Computing Surveys (CSUR)
A join tree probability propagation architecture for semantic modeling
Journal of Intelligent Information Systems
Efficient solution algorithms for factored MDPs
Journal of Artificial Intelligence Research
Decomposition of structural learning about directed acyclic graphs
Artificial Intelligence
Treewidth computations I. Upper bounds
Information and Computation
Treewidth: characterizations, applications, and computations
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
A branch and bound algorithm for exact, upper, and lower bounds on treewidth
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Review: learning bayesian networks: Approaches and issues
The Knowledge Engineering Review
Fully dynamic algorithm for chordal graphs with O(1) query-time and O(n 2) update-time
Theoretical Computer Science
Exploiting the probability of observation for efficient bayesian network inference
Canadian AI'12 Proceedings of the 25th Canadian conference on Advances in Artificial Intelligence
| Hi-index | 0.00 |