Lars Otten
Title
Cited by
Cited by
Year
Anytime AND/OR depth-first search for combinatorial optimization
L Otten, R Dechter
Ai Communications 25 (3), 211-227, 2012
562012
Join-graph based cost-shifting schemes
AT Ihler, N Flerova, R Dechter, L Otten
arXiv preprint arXiv:1210.4878, 2012
472012
A system for exact and approximate genetic linkage analysis of SNP data in large pedigrees
M Silberstein, O Weissbrod, L Otten, A Tzemach, A Anisenia, O Shtark, ...
Bioinformatics 29 (2), 197-205, 2013
402013
Pushing the power of stochastic greedy ordering schemes for inference in graphical models
K Kask, A Gelfand, L Otten, R Dechter
Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011
362011
Predicting the size of depth-first branch and bound search trees
LHS Lelis, L Otten, R Dechter
Twenty-Third International Joint Conference on Artificial Intelligence, 2013
312013
Winning the pascal 2011 map challenge with enhanced and/or branch-and-bound
L Otten, A Ihler, K Kask, R Dechter
IN NIPS WORKSHOP DISCML, 2012
212012
A case study in complexity estimation: Towards parallel branch-and-bound over graphical models
L Otten, R Dechter
arXiv preprint arXiv:1210.4885, 2012
152012
Toward parallel search for optimization in graphical models.
L Otten, R Dechter
ISAIM, 2010
152010
Results from the Probablistic Inference Evaluation of UAI’08
A Darwiche, R Dechter, A Choi, V Gogate, L Otten
UAI Applications Workshop, 2008
112008
Randomization in constraint programming for airline planning
L Otten, M Gr÷nkvist, D Dubhashi
International Conference on Principles and Practice of Constraintá…, 2006
112006
AND/OR branch-and-bound on a computational grid
L Otten, R Dechter
Journal of Artificial Intelligence Research 59, 351-435, 2017
102017
Memory-efficient tree size prediction for depth-first search in graphical models
LHS Lelis, L Otten, R Dechter
International Conference on Principles and Practice of Constraintá…, 2014
92014
On the Practical Significance of Hypertree vs. TreeWidth.
R Dechter, L Otten, R Marinescu
ECAI, 913-914, 2008
72008
Bounding search space size via (hyper) tree decompositions
L Otten, R Dechter
arXiv preprint arXiv:1206.3284, 2012
52012
Mini-bucket elimination with moment matching
N Flerova, A Ihler, R Dechter, L Otten
NIPS Workshop DISCML, 2011
52011
Load balancing for parallel branch and bound
L Otten, R Dechter
10th Workshop on Preferences and Soft Constraints, 51-65, 2010
42010
Advances in Distributed Branch and Bound.
L Otten, R Dechter
ECAI, 917-918, 2012
32012
Finding most likely haplotypes in general pedigrees through parallel search with dynamic load balancing
L Otten, R Dechter
Biocomputing 2011, 26-37, 2011
32011
Refined bounds for instance-based search complexity of counting and other# P problems
L Otten, R Dechter
International Conference on Principles and Practice of Constraintá…, 2008
32008
Caching in context-minimal or spaces
R Dechter, LHS Lelis, L Otten
Eighth Annual Symposium on Combinatorial Search, 2015
12015
The system can't perform the operation now. Try again later.
Articles 1–20