default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch 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 617 matches
- 2024
- Michael Katz, Junkyu Lee, Jungkoo Kang, Shirin Sohrabi:
Some Orders Are Important: Partially Preserving Orders in Top-Quality Planning. SOCS 2024: 213-217 - Yihao Liu, Xueyan Tang, Wentong Cai, Jingning Li:
Multi-Agent Path Execution with Uncertainty. SOCS 2024: 64-72 - Zhe Chen, Daniel Harabor, Jiaoyang Li, Peter J. Stuckey:
Traffic Flow Optimisation for Lifelong Multi-Agent Path Finding (Extended Abstract). SOCS 2024: 265-266 - Han Zhang, Oren Salzman, Ariel Felner, T. K. Satish Kumar, Carlos Hernández Ulloa, Sven Koenig:
Speeding Up Dominance Checks in Multi-Objective Search: New Techniques and Data Structures. SOCS 2024: 228-232 - Han Zhang, Oren Salzman, Ariel Felner, Carlos Hernández Ulloa, Sven Koenig:
A-A*pex: Efficient Anytime Approximate Multi-Objective Search. SOCS 2024: 179-187 - Abdallah Abu-Aisha, Mark Wallace, Daniel Harabor, Bojie Shen:
Efficient and Exact Public Transport Routing via a Transfer Connection Database. SOCS 2024: 2-10 - Saman Ahmadi
:
Parallelizing Multi-objective A* Search (Extended Abstract). SOCS 2024: 253-254 - Pablo Araneda, Carlos Hernández Ulloa, Nicolás Rivera, Jorge A. Baier:
Finding a Small, Diverse Subset of the Pareto Solution Set in Bi-Objective Search (Extended Abstract). SOCS 2024: 255-256 - Masataro Asai, Stephen Wissow:
Extreme Value Monte Carlo Tree Search (Extended Abstract). SOCS 2024: 257-258 - Shahar Bardugo, Dor Atzmon:
Finiding All Optimal Solutions in Multi-Agent Path Finding (Extended Abstract). SOCS 2024: 259-260 - Yarin Benyamin, Argaman Mordoch, Shahaf S. Shperberg, Wiktor Piotrowski, Roni Stern:
Crafting a Pogo Stick in Minecraft with Heuristic Search (Extended Abstract). SOCS 2024: 261-262 - Pierre Le Bodic, Edward Lam:
Optimal Unlabeled Pebble Motion on Trees. SOCS 2024: 218-222 - Clemens Büchner, Remo Christen, Salomé Eriksson, Thomas Keller:
Hitting Set Heuristics for Overlapping Landmarks in Satisficing Planning. SOCS 2024: 198-202 - Chao Cao, Jinyun Xu, Ji Zhang, Howie Choset, Zhongqiang Ren:
Heuristic Search for the Orienteering Problem with Time-Varying Reward. SOCS 2024: 11-19 - Matteo Cardellini, Marco Maratea, Francesco Percassi, Enrico Scala, Mauro Vallati:
Taming Discretised PDDL+ through Multiple Discretisations (Extended Abstract). SOCS 2024: 263-264 - Mark Carlson, Daniel Harabor, Peter J. Stuckey:
Avoiding Node Re-Expansions Can Break Symmetry Breaking. SOCS 2024: 20-27 - Dillon Z. Chen, Sylvie Thiébaux:
Novelty Heuristics, Multi-Queue Search, and Portfolios for Numeric Planning. SOCS 2024: 203-207 - Md. Solimul Chowdhury, Martin Müller, Jia-Huai You:
Exploring Conflict Generating Decisions: Initial Results (Extended Abstract). SOCS 2024: 267-268 - Gal Dahan, Itay Tabib, Solomon Eyal Shimony, Yefim Dinitz:
Generalized Longest Simple Path Problems: Speeding up Search Using SPQR Trees. SOCS 2024: 28-36 - Santiago Franco, Jamie O. Roberts, Sara Bernardini:
Lazy Evaluation of Negative Preconditions in Planning Domains (Extended Abstract). SOCS 2024: 271-272 - Jiang He, Yulun Zhang, Rishi Veerapaneni, Jiaoyang Li:
Scaling Lifelong Multi-Agent Path Finding to More Realistic Settings: Research Challenges and Opportunities. SOCS 2024: 234-242 - Justin Kottinger, Tzvika Geft, Shaull Almagor, Oren Salzman, Morteza Lahijanian:
Introducing Delays in Multi Agent Path Finding. SOCS 2024: 37-45 - Anas El Kouaiti, Francesco Percassi, Alessandro Saetti, Thomas Leo McCluskey, Mauro Vallati:
Deployable Yet Effective Traffic Signal Optimisation via Automated Planning (Extended Abstract). SOCS 2024: 269-270 - Daniel Koyfman, Shahaf S. Shperberg, Dor Atzmon, Ariel Felner:
Minimizing State Exploration While Searching Graphs with Unknown Obstacles (Extended Abstract). SOCS 2024: 273-274 - Ang Li, Peter J. Stuckey, Sven Koenig, T. K. Satish Kumar:
Solving Facility Location Problems via FastMap and Locality Sensitive Hashing. SOCS 2024: 46-54 - Songtuan Lin, Daniel Höller, Pascal Bercher:
Modeling Assistance for Hierarchical Planning: An Approach for Correcting Hierarchical Domains with Missing Actions. SOCS 2024: 55-63 - Rodrigo López, Roberto Javier Asín Achá, Jorge A. Baier:
A New Upper Bound for the Makespan of Cost-Optimal Solutions for Multi-Agent Path Finding (Extended Abstract). SOCS 2024: 275-276 - Sean Mariasin, Andrew Coles, Erez Karpas, Wheeler Ruml, Solomon Eyal Shimony, Shahaf S. Shperberg:
Evaluating Distributional Predictions of Search Time: Put Up or Shut Up Games (Extended Abstract). SOCS 2024: 277-278 - Evgeny Mishlyakov, Mikhail Gruntov, Alexander Shleyfman, Erez Karpas:
A Deterministic Search Approach for Solving Stochastic Drone Search and Rescue Planning Without Communications. SOCS 2024: 73-81 - Jonathan Morag, Yue Zhang, Daniel Koyfman, Zhe Chen, Ariel Felner, Daniel Harabor, Roni Stern:
Prioritised Planning with Guarantees. SOCS 2024: 82-90
skipping 587 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 2024-11-24 09:54 CET 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
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:
