default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLars Otten
Person information
- affiliation: University of California, Irvine, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j4]Lars Otten, Rina Dechter:
AND/OR Branch-and-Bound on a Computational Grid. J. Artif. Intell. Res. 59: 351-435 (2017)- 2015
- [c16]Rina Dechter, Levi H. S. Lelis, Lars Otten:
Caching in Context-Minimal OR Spaces. SOCS 2015: 171-175 - 2014
- [c15]Levi H. S. Lelis, Lars Otten, Rina Dechter:
Memory-Efficient Tree Size Prediction for Depth-First Search in Graphical Models. CP 2014: 481-496 - [c14]Lars Otten, Rina Dechter:
Anytime AND/OR Depth-First Search for Combinatorial Optimization - (Extended Abstract). CP 2014: 933-937 - 2013
- [j3]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): 197-205 (2013) - [j2]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): 669 (2013) - [c13]Levi H. S. Lelis, Lars Otten, Rina Dechter:
Predicting the Size of Depth-First Branch and Bound Search Trees. IJCAI 2013: 594-600 - [c12]Lars Otten:
Vermittlung von Konzepten der Informationstechnik in Oberstufen der beruflichen Bildung technischer Fachrichtungen unter Verwendung mobiler Roboter als Lernträger. INFOS 2013: 127-136 - 2012
- [j1]Lars Otten, Rina Dechter:
Anytime AND/OR depth-first search for combinatorial optimization. AI Commun. 25(3): 211-227 (2012) - [c11]Lars Otten, Rina Dechter:
Advances in Distributed Branch and Bound. ECAI 2012: 917-918 - [c10]Alexander Ihler, Natalia Flerova, Rina Dechter, Lars Otten:
Join-graph based cost-shifting schemes. UAI 2012: 397-406 - [c9]Lars Otten, Rina Dechter:
A Case Study in Complexity Estimation: Towards Parallel Branch-and-Bound over Graphical Models. UAI 2012: 665-674 - [i3]Lars Otten, Rina Dechter:
Bounding Search Space Size via (Hyper)tree Decompositions. CoRR abs/1206.3284 (2012) - [i2]Alexander Ihler, Natalia Flerova, Rina Dechter, Lars Otten:
Join-graph based cost-shifting schemes. CoRR abs/1210.4878 (2012) - [i1]Lars Otten, Rina Dechter:
A Case Study in Complexity Estimation: Towards Parallel Branch-and-Bound over Graphical Models. CoRR abs/1210.4885 (2012) - 2011
- [c8]Kalev Kask, Andrew Gelfand, Lars Otten, Rina Dechter:
Pushing the Power of Stochastic Greedy Ordering Schemes for Inference in Graphical Models. AAAI 2011: 54-60 - [c7]Lars Otten, Rina Dechter:
Finding Most Likely Haplotypes in General Pedigrees Through Parallel Search with Dynamic Load Balancing. Pacific Symposium on Biocomputing 2011: 26-37 - [c6]Lars Otten, Rina Dechter:
Anytime AND/OR Depth-First Search for Combinatorial Optimization. SOCS 2011: 117-124 - 2010
- [c5]Lars Otten, Rina Dechter:
Toward parallel search for optimization in graphical models. ISAIM 2010
2000 – 2009
- 2008
- [c4]Lars Otten, Rina Dechter:
Refined Bounds for Instance-Based Search Complexity of Counting and Other #P Problems. CP 2008: 576-581 - [c3]Rina Dechter, Lars Otten, Radu Marinescu:
On the Practical Significance of Hypertree vs. TreeWidth. ECAI 2008: 913-914 - [c2]Lars Otten, Rina Dechter:
Bounding Search Space Size via (Hyper)tree Decompositions. UAI 2008: 452-459 - 2006
- [c1]Lars Otten, Mattias Grönkvist, Devdatt P. Dubhashi:
Randomization in Constraint Programming for Airline Planning. CP 2006: 406-420
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
