Mini-buckets: A general scheme for bounded inference
Journal of the ACM (JACM)
A General Scheme for Multiple Lower Bound Computation in Constraint Optimization
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Complexity results for explanations in the structural-model approach
Artificial Intelligence
Unifying tree decompositions for reasoning in graphical models
Artificial Intelligence
Memory intensive branch-and-bound search for graphical models
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
AND/OR Branch-and-Bound search for combinatorial optimization in graphical models
Artificial Intelligence
Memory intensive AND/OR search for combinatorial optimization in graphical models
Artificial Intelligence
Journal of Artificial Intelligence Research
Solving weighted constraint satisfaction problems with memetic/exact hybrid algorithms
Journal of Artificial Intelligence Research
AND/OR branch-and-bound for graphical models
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Unifying tree decompositions for reasoning in graphical models
Artificial Intelligence
Exploiting problem decomposition in multi-objective constraint optimization
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Join-graph propagation algorithms
Journal of Artificial Intelligence Research
Multi-dimensional classification with Bayesian networks
International Journal of Approximate Reasoning
On mini-buckets and the min-fill elimination ordering
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Mini-bucket elimination with bucket propagation
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence
Systematic vs. non-systematic algorithms for solving the MPE task
UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence
Importance sampling-based estimation over AND/OR search spaces for graphical models
Artificial Intelligence
Anytime AND/OR depth-first search for combinatorial optimization
AI Communications - The Symposium on Combinatorial Search
Predicting the size of depth-first branch and bound search trees
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |