default search action
Ethan Burns
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
- [j5]Matthew Hatem, Ethan Burns, Wheeler Ruml
:
Solving Large Problems with Heuristic Search: General-Purpose Parallel External-Memory Search. J. Artif. Intell. Res. 62: 233-268 (2018) - 2015
- [j4]Scott Kiesel, Ethan Burns, Wheeler Ruml
Achieving Goals Quickly Using Real-time Search: Experimental Results in Video Games. J. Artif. Intell. Res. 54: 123-158 (2015) - 2014
- [i1]Ethan Burns, Sofia Lemons, Wheeler Ruml, Rong Zhou:
Best-First Heuristic Search for Multicore Machines. CoRR abs/1401.3861 (2014) - 2013
- [j3]Ethan Burns, Wheeler Ruml
Iterative-deepening search with on-line tree size prediction. Ann. Math. Artif. Intell. 69(2): 183-205 (2013) - [j2]Ethan Burns, Wheeler Ruml
Heuristic Search When Time Matters. J. Artif. Intell. Res. 47: 697-740 (2013) - [c14]Ethan Burns, Scott Kiesel, Wheeler Ruml:
Experimental Real-Time Heuristic Search Results in a Video Game. SOCS 2013: 47-54 - 2012
- [c13]Ethan Andrew Burns:
Planning Under Time Pressure. AAAI 2012: 2382-2383 - [c12]Ethan Burns, J. Benton, Wheeler Ruml, Sung Wook Yoon, Minh Binh Do:
Anticipatory On-Line Planning. ICAPS 2012 - [c11]Scott Kiesel, Ethan Burns, Christopher Makoto Wilt, Wheeler Ruml:
Integrating Vehicle Routing and Motion Planning. ICAPS 2012 - [c10]Ethan Burns, Wheeler Ruml
Iterative-Deepening Search with On-Line Tree Size Prediction. LION 2012: 1-15 - [c9]Ethan Andrew Burns, Matthew Hatem, Michael J. Leighton, Wheeler Ruml:
Implementing Fast Heuristic Search Code. SOCS 2012: 25-32 - [c8]Scott Kiesel, Ethan Burns, Wheeler Ruml:
Abstraction-Guided Sampling for Motion Planning. SOCS 2012: 162-163 - [c7]Ethan Burns, Rong Zhou:
Parallel Model Checking Using Abstraction. SPIN 2012: 172-190 - 2011
- [c6]Matthew Hatem, Ethan Burns, Wheeler Ruml:
Heuristic Search for Large Problems With Real Costs. AAAI 2011: 30-35 - [c5]Kevin Rose, Ethan Burns, Wheeler Ruml:
Best-First Search for Bounded-Depth Trees. SOCS 2011: 134-141 - 2010
- [j1]Ethan Burns, Sofia Lemons, Wheeler Ruml
Best-First Heuristic Search for Multicore Machines. J. Artif. Intell. Res. 39: 689-743 (2010) - [c4]Ethan Burns, Sofia Lemons, Wheeler Ruml, Rong Zhou:
Parallel Best-First Search: The Role of Abstraction. Abstraction, Reformulation, and Approximation 2010 - [c3]Bradford John Larsen, Ethan Burns, Wheeler Ruml, Robert Holte:
Searching Without a Heuristic: Efficient Use of Abstraction. AAAI 2010: 114-120
2000 – 2009
- 2009
- [c2]Ethan Burns, Seth Lemons, Wheeler Ruml, Rong Zhou:
Suboptimal and Anytime Heuristic Search on Multi-Core Machines. ICAPS 2009 - [c1]Ethan Burns, Seth Lemons, Rong Zhou, Wheeler Ruml:
Best-First Heuristic Search for Multi-Core Machines. IJCAI 2009: 449-455
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 23:16 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: