Lars Otten

Publication Activity (10 Years)

Years Active: 2006-2017
Publications (10 Years): 1

Top Topics

Branch And Bound

Depth First Search

Combinatorial Optimization

Top Venues

Publications

Lars Otten, Rina Dechter
AND/OR Branch-and-Bound on a Computational Grid. J. Artif. Intell. Res. 59 (2017)
Rina Dechter, Levi H. S. Lelis, Lars Otten
Caching in Context-Minimal OR Spaces. SOCS (2015)
Lars Otten, Rina Dechter
Anytime AND/OR Depth-First Search for Combinatorial Optimization - (Extended Abstract). CP (2014)
Levi H. S. Lelis, Lars Otten, Rina Dechter
Memory-Efficient Tree Size Prediction for Depth-First Search in Graphical Models. CP (2014)
Levi H. S. Lelis, Lars Otten, Rina Dechter
Predicting the Size of Depth-First Branch and Bound Search Trees. IJCAI (2013)
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
A system for exact and approximate genetic linkage analysis of SNP data in large pedigrees. Bioinform. 29 (2) (2013)
Lars Otten
Vermittlung von Konzepten der Informationstechnik in Oberstufen der beruflichen Bildung technischer Fachrichtungen unter Verwendung mobiler Roboter als Lernträger. INFOS (2013)
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
A system for exact and approximate genetic linkage analysis of SNP data in large pedigrees. Bioinform. 29 (5) (2013)
Lars Otten, Rina Dechter
A Case Study in Complexity Estimation: Towards Parallel Branch-and-Bound over Graphical Models. UAI (2012)
Lars Otten, Rina Dechter
A Case Study in Complexity Estimation: Towards Parallel Branch-and-Bound over Graphical Models CoRR (2012)
Alexander T. Ihler, Natalia Flerova, Rina Dechter, Lars Otten
Join-graph based cost-shifting schemes. UAI (2012)
Lars Otten, Rina Dechter
Bounding Search Space Size via (Hyper)tree Decompositions CoRR (2012)
Alexander T. Ihler, Natalia Flerova, Rina Dechter, Lars Otten
Join-graph based cost-shifting schemes CoRR (2012)
Lars Otten, Rina Dechter
Anytime AND/OR depth-first search for combinatorial optimization. AI Commun. 25 (3) (2012)
Lars Otten, Rina Dechter
Advances in Distributed Branch and Bound. ECAI (2012)
Lars Otten, Rina Dechter
Finding Most Likely Haplotypes in General Pedigrees Through Parallel Search with Dynamic Load Balancing. Pacific Symposium on Biocomputing (2011)
Kalev Kask, Andrew Gelfand, Lars Otten, Rina Dechter
Pushing the Power of Stochastic Greedy Ordering Schemes for Inference in Graphical Models. AAAI (2011)
Lars Otten, Rina Dechter
Anytime AND/OR Depth-First Search for Combinatorial Optimization. SOCS (2011)
Lars Otten, Rina Dechter
Toward parallel search for optimization in graphical models. ISAIM (2010)
Lars Otten, Rina Dechter
Bounding Search Space Size via (Hyper)tree Decompositions. UAI (2008)
Lars Otten, Rina Dechter
Refined Bounds for Instance-Based Search Complexity of Counting and Other #P Problems. CP (2008)
Rina Dechter, Lars Otten, Radu Marinescu
On the Practical Significance of Hypertree vs. TreeWidth. ECAI (2008)
Lars Otten, Mattias Grönkvist, Devdatt P. Dubhashi
Randomization in Constraint Programming for Airline Planning. CP (2006)