Author of the publication

Memory-Efficient Tree Size Prediction for Depth-First Search in Graphical Models.

, , and . CP, volume 8656 of Lecture Notes in Computer Science, page 481-496. Springer, (2014)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Uncovering Trees in Constraint Networks., , and . Artif. Intell., 86 (2): 245-267 (1996)A Case Study in Complexity Estimation: Towards Parallel Branch-and-Bound over Graphical Models., and . UAI, page 665-674. AUAI Press, (2012)NeuroBE: Escalating neural network approximations of Bucket Elimination., , , and . UAI, volume 180 of Proceedings of Machine Learning Research, page 11-21. PMLR, (2022)AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Weighted Graphical Models., and . UAI, page 276-284. AUAI Press, (2007)On the Practical Significance of Hypertree vs. TreeWidth., , and . ECAI, volume 178 of Frontiers in Artificial Intelligence and Applications, page 913-914. IOS Press, (2008)Self-stabilizing Distributed Constraint Satisfaction, , and . Chicago Journal of Theoretical Computer Science, (1999)Dynamic Orderings for AND/OR Branch-and-Bound Search in Graphical Models., and . ECAI, volume 141 of Frontiers in Artificial Intelligence and Applications, page 138-142. IOS Press, (2006)Subproblem ordering heuristics for AND/OR best-first search., , , and . J. Comput. Syst. Sci., (2018)An Empirical Study of w-Cutset Sampling for Bayesian Networks, and . CoRR, (2012)A General Scheme for Multiple Lower Bound Computation in Constraint Optimization., , and . CP, volume 2239 of Lecture Notes in Computer Science, page 346-360. Springer, (2001)