AND/OR Branch-and-Bound on a Computational Grid.
J. Artif. Intell. Res., 2017
Caching in Context-Minimal OR Spaces.
Proceedings of the Eighth Annual Symposium on Combinatorial Search, 2015
Anytime AND/OR Depth-First Search for Combinatorial Optimization - (Extended Abstract).
Proceedings of the Principles and Practice of Constraint Programming, 2014
Memory-Efficient Tree Size Prediction for Depth-First Search in Graphical Models.
Proceedings of the Principles and Practice of Constraint Programming, 2014
A system for exact and approximate genetic linkage analysis of SNP data in large pedigrees.
,
,
,
,
,
,
,
,
,
,
,
,
,
Bioinform., 2013
Vermittlung von Konzepten der Informationstechnik in Oberstufen der beruflichen Bildung technischer Fachrichtungen unter Verwendung mobiler Roboter als Lernträger.
Proceedings of the Informatik erweitert Horizonte, 2013
Predicting the Size of Depth-First Branch and Bound Search Trees.
Proceedings of the IJCAI 2013, 2013
Anytime AND/OR depth-first search for combinatorial optimization.
AI Commun., 2012
A Case Study in Complexity Estimation: Towards Parallel Branch-and-Bound over Graphical Models.
Proceedings of the Twenty-Eighth Conference on Uncertainty in Artificial Intelligence, 2012
Join-graph based cost-shifting schemes.
Proceedings of the Twenty-Eighth Conference on Uncertainty in Artificial Intelligence, 2012
Advances in Distributed Branch and Bound.
Proceedings of the ECAI 2012, 2012
Finding Most Likely Haplotypes in General Pedigrees Through Parallel Search with Dynamic Load Balancing.
Proceedings of the Biocomputing 2011: Proceedings of the Pacific Symposium, 2011
Pushing the Power of Stochastic Greedy Ordering Schemes for Inference in Graphical Models.
Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011
Toward parallel search for optimization in graphical models.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2010
Bounding Search Space Size via (Hyper)tree Decompositions.
Proceedings of the UAI 2008, 2008
On the Practical Significance of Hypertree vs. TreeWidth.
Proceedings of the ECAI 2008, 2008
Refined Bounds for Instance-Based Search Complexity of Counting and Other #P Problems.
Proceedings of the Principles and Practice of Constraint Programming, 2008
Randomization in Constraint Programming for Airline Planning.
Proceedings of the Principles and Practice of Constraint Programming, 2006