Lars Otten

According to our database, Lars Otten authored at least 18 papers between 2006 and 2017.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2017

AND/OR Branch-and-Bound on a Computational Grid.

Lars Otten, Rina Dechter

J. Artif. Intell. Res., 2017

2015

Caching in Context-Minimal OR Spaces.

Rina Dechter, Levi H. S. Lelis, Lars Otten

Proceedings of the Eighth Annual Symposium on Combinatorial Search, 2015

2014

Anytime AND/OR Depth-First Search for Combinatorial Optimization - (Extended Abstract).

Lars Otten, Rina Dechter

Proceedings of the Principles and Practice of Constraint Programming, 2014

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

Levi H. S. Lelis, Lars Otten, Rina Dechter

Proceedings of the Principles and Practice of Constraint Programming, 2014

2013

A system for exact and approximate genetic linkage analysis of SNP data in large pedigrees.

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

Bioinform., 2013

Vermittlung von Konzepten der Informationstechnik in Oberstufen der beruflichen Bildung technischer Fachrichtungen unter Verwendung mobiler Roboter als Lernträger.

Lars Otten

Proceedings of the Informatik erweitert Horizonte, 2013

Predicting the Size of Depth-First Branch and Bound Search Trees.

Levi H. S. Lelis, Lars Otten, Rina Dechter

Proceedings of the IJCAI 2013, 2013

2012

Anytime AND/OR depth-first search for combinatorial optimization.

Lars Otten, Rina Dechter

AI Commun., 2012

A Case Study in Complexity Estimation: Towards Parallel Branch-and-Bound over Graphical Models.

Lars Otten, Rina Dechter

Proceedings of the Twenty-Eighth Conference on Uncertainty in Artificial Intelligence, 2012

Join-graph based cost-shifting schemes.

Alexander Ihler, Natalia Flerova, Rina Dechter, Lars Otten

Proceedings of the Twenty-Eighth Conference on Uncertainty in Artificial Intelligence, 2012

Advances in Distributed Branch and Bound.

Lars Otten, Rina Dechter

Proceedings of the ECAI 2012, 2012

2011

Finding Most Likely Haplotypes in General Pedigrees Through Parallel Search with Dynamic Load Balancing.

Lars Otten, Rina Dechter

Proceedings of the Biocomputing 2011: Proceedings of the Pacific Symposium, 2011

Pushing the Power of Stochastic Greedy Ordering Schemes for Inference in Graphical Models.

Kalev Kask, Andrew Gelfand, Lars Otten, Rina Dechter

Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

2010

Toward parallel search for optimization in graphical models.

Lars Otten, Rina Dechter

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2010

2008

Bounding Search Space Size via (Hyper)tree Decompositions.

Lars Otten, Rina Dechter

Proceedings of the UAI 2008, 2008

On the Practical Significance of Hypertree vs. TreeWidth.

Rina Dechter, Lars Otten, Radu Marinescu

Proceedings of the ECAI 2008, 2008

Refined Bounds for Instance-Based Search Complexity of Counting and Other #P Problems.

Lars Otten, Rina Dechter

Proceedings of the Principles and Practice of Constraint Programming, 2008

2006

Randomization in Constraint Programming for Airline Planning.

Lars Otten, Mattias Grönkvist, Devdatt P. Dubhashi

Proceedings of the Principles and Practice of Constraint Programming, 2006