default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 35 matches
- 2010
- Yuima Akagi, Akihiro Kishimoto, Alex Fukunaga:
On Transposition Tables for Single-Agent Search and Planning: Summary of Results. SOCS 2010: 2-9 - Kenneth Anderson:
Additive Heuristic for Four-Connected Gridworlds. SOCS 2010: 10-15 - Shahab Jabbari Arfaee, Sandra Zilles, Robert C. Holte:
Bootstrap Learning of Heuristic Functions. SOCS 2010: 52-60 - Subhrajit Bhattacharya, Vijay Kumar, Maxim Likhachev:
Search-Based Path Planning with Homotopy Class Constraints. SOCS 2010: 145-146 - David Bond, Niels A. Widger, Wheeler Ruml, Xiaoxun Sun:
Real-Time Search in Dynamic Worlds. SOCS 2010: 16-22 - William Cushing, J. Benton, Subbarao Kambhampati:
Cost Based Search Considered Harmful. SOCS 2010: 140-141 - Stefan Edelkamp, Damian Sulewski, Cengizhan Yücel:
GPU Exploration of Two-Player Games with Perfect Hash Functions. SOCS 2010: 23-30 - Patrick Eyerich, Thomas Keller, Malte Helmert:
High-Quality Policies for the Canadian Traveler's Problem. SOCS 2010: 147-148 - Robert Geisberger, Dennis Schieferdecker:
Heuristic Contraction Hierarchies with Approximation Guarantee. SOCS 2010: 31-38 - Meir Goldenberg, Ariel Felner, Nathan R. Sturtevant, Jonathan Schaeffer:
Portal-Based True-Distance Heuristics for Path Finding. SOCS 2010: 39-45 - Ami Hauptman, Achiya Elyasaf, Moshe Sipper:
Evolving Hyper Heuristic-Based Solvers for Rush Hour and FreeCell. SOCS 2010: 149-150 - Malte Helmert:
Landmark Heuristics for the Pancake Problem. SOCS 2010: 109-110 - Robert C. Holte:
Common Misconceptions Concerning Heuristic Search. SOCS 2010: 46-51 - Eric I. Hsu, Sheila A. McIlraith:
Computing Equivalent Transformations for Combinatorial Optimization by Branch-and-Bound Search. SOCS 2010: 111-112 - Akihiro Kishimoto, Alex Fukunaga, Adi Botea:
On the Scaling Behavior of HDA. SOCS 2010: 61-62 - Peter Kissmann, Stefan Edelkamp:
Layer-Abstraction for Symbolically Solving General Two-Player Games. SOCS 2010: 63-70 - Richard E. Korf:
Objective Functions for Multi-Way Number Partitioning. SOCS 2010: 71-72 - Carlos Linares López, Daniel Borrajo:
Adding Diversity to Classical Heuristic Planning. SOCS 2010: 73-80 - Carsten Moldenhauer, Ariel Felner, Nathan R. Sturtevant, Jonathan Schaeffer:
Single-Frontier Bidirectional Search. SOCS 2010: 151-152 - Hootan Nakhost, Jörg Hoffmann, Martin Müller:
Improving Local Search for Resource-Constrained Planning. SOCS 2010: 81-82 - Alex Nash, Sven Koenig, Craig A. Tovey:
Lazy Theta*: Any-Angle Path Planning and Path Length Analysis in 3D. SOCS 2010: 153-154 - Nir Pochter, Aviv Zohar, Jeffrey S. Rosenschein, Ariel Felner:
Search Space Reduction Using Swamp Hierarchies. SOCS 2010: 155-156 - Wheeler Ruml:
The Logic of Benchmarking: A Case Against State-of-the-Art Performance. SOCS 2010: 142-143 - Roni Tzvi Stern, Meir Kalech, Ariel Felner:
Searching for a k-Clique in Unknown Graphs. SOCS 2010: 83-89 - Roni Tzvi Stern, Rami Puzis, Ariel Felner:
Potential Search: A New Greedy Anytime Heuristic Search. SOCS 2010: 119-120 - Andrew M. Sutton, Adele E. Howe, L. Darrell Whitley:
Directed Plateau Search for MAX-k-SAT. SOCS 2010: 90-97 - Jordan Tyler Thayer, Wheeler Ruml:
Finding Acceptable Solutions Faster Using Inadmissible Information. SOCS 2010: 98-99 - Jordan Tyler Thayer, Wheeler Ruml:
Anytime Heuristic Search: Frameworks and Algorithms. SOCS 2010: 121-128 - Richard Anthony Valenzano, Nathan R. Sturtevant, Jonathan Schaeffer, Karen Buro, Akihiro Kishimoto:
Simultaneously Searching with Multiple Settings: An Alternative to Parameter Tuning for Suboptimal Single-Agent Search Algorithms. SOCS 2010: 157-158 - Vincent Vidal, Lucas Bordeaux, Youssef Hamadi:
Adaptive K-Parallel Best-First Search: A Simple but Efficient Algorithm for Multi-Core Domain-Independent Planning. SOCS 2010: 100-107
skipping 5 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2025-08-16 23:36 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint