Lars Otten

23 papers A* 2A 9B 2Misc 2Journal 7Unranked 1
YearRankTypeTitle / Venue / Authors
2017 J jnl
AND/OR Branch-and-Bound on a Computational Grid.
J. Artif. Intell. Res.
Lars Otten, Rina Dechter
2015 B conf
Caching in Context-Minimal OR Spaces.
SOCS
Rina Dechter, Levi H. S. Lelis, Lars Otten
2014 A conf
Anytime AND/OR Depth-First Search for Combinatorial Optimization - (Extended Abstract).
CP
Lars Otten, Rina Dechter
2014 A conf
Memory-Efficient Tree Size Prediction for Depth-First Search in Graphical Models.
CP
Levi H. S. Lelis, Lars Otten, Rina Dechter
2013 J jnl
A system for exact and approximate genetic linkage analysis of SNP data in large pedigrees.
Bioinform.
Mark Silberstein, Omer Weissbrod, Lars Otten, Anna Tzemach, Andrei Anisenia, Oren Shtark, Dvir Tuberg, Eddie Galfrin, Irena Gannon, Adel Shalata, Zvi U. Borochowitz, Rina Dechter, Elizabeth Thompson, Dan Geiger
2013 J jnl
A system for exact and approximate genetic linkage analysis of SNP data in large pedigrees.
Bioinform.
Mark Silberstein, Omer Weissbrod, Lars Otten, Anna Tzemach, Andrei Anisenia, Oren Shtark, Dvir Tuberg, Eddie Galfrin, Irena Gannon, Adel Shalata, Zvi U. Borochowitz, Rina Dechter, Elizabeth Thompson, Dan Geiger
2013 A* conf
Predicting the Size of Depth-First Branch and Bound Search Trees.
IJCAI
Levi H. S. Lelis, Lars Otten, Rina Dechter
2013 — conf
Vermittlung von Konzepten der Informationstechnik in Oberstufen der beruflichen Bildung technischer Fachrichtungen unter Verwendung mobiler Roboter als Lernträger.
INFOS
Lars Otten
2012 J jnl
A Case Study in Complexity Estimation: Towards Parallel Branch-and-Bound over Graphical Models
CoRR
Lars Otten, Rina Dechter
2012 A conf
A Case Study in Complexity Estimation: Towards Parallel Branch-and-Bound over Graphical Models.
UAI
Lars Otten, Rina Dechter
2012 A conf
Advances in Distributed Branch and Bound.
ECAI
Lars Otten, Rina Dechter
2012 J jnl
Anytime AND/OR depth-first search for combinatorial optimization.
AI Commun.
Lars Otten, Rina Dechter
2012 J jnl
Bounding Search Space Size via (Hyper)tree Decompositions
CoRR
Lars Otten, Rina Dechter
2012 J jnl
Join-graph based cost-shifting schemes
CoRR
Alexander Ihler, Natalia Flerova, Rina Dechter, Lars Otten
2012 A conf
Join-graph based cost-shifting schemes.
UAI
Alexander Ihler, Natalia Flerova, Rina Dechter, Lars Otten
2011 B conf
Anytime AND/OR Depth-First Search for Combinatorial Optimization.
SOCS
Lars Otten, Rina Dechter
2011 Misc conf
Finding Most Likely Haplotypes in General Pedigrees Through Parallel Search with Dynamic Load Balancing.
Pacific Symposium on Biocomputing
Lars Otten, Rina Dechter
2011 A* conf
Pushing the Power of Stochastic Greedy Ordering Schemes for Inference in Graphical Models.
AAAI
Kalev Kask, Andrew Gelfand, Lars Otten, Rina Dechter
2010 Misc conf
Toward parallel search for optimization in graphical models.
ISAIM
Lars Otten, Rina Dechter
2008 A conf
Bounding Search Space Size via (Hyper)tree Decompositions.
UAI
Lars Otten, Rina Dechter
2008 A conf
On the Practical Significance of Hypertree vs. TreeWidth.
ECAI
Rina Dechter, Lars Otten, Radu Marinescu
2008 A conf
Refined Bounds for Instance-Based Search Complexity of Counting and Other #P Problems.
CP
Lars Otten, Rina Dechter
2006 A conf
Randomization in Constraint Programming for Airline Planning.
CP
Lars Otten, Mattias Grönkvist, Devdatt P. Dubhashi