Остановите войну!
for scientists:
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 46 matches
- 2019
- Hang Ma, Wolfgang Hönig, T. K. Satish Kumar, Nora Ayanian, Sven Koenig:
Extended Abstract: Lifelong Path Planning with Kinematic Constraintsfor Multi-Agent Pickup and Delivery. SOCS 2019: 190-191 - Hang Ma, Daniel Harabor, Peter J. Stuckey, Jiaoyang Li, Sven Koenig:
Extended Abstract: Searching with Consistent Prioritization for Multi-Agent Path Finding. SOCS 2019: 188-189 - Ryo Kuroiwa, Alex Fukunaga:
A Case Study on the Importance of Low-Level Algorithmic Details in Domain-Independent Heuristics. SOCS 2019: 180-181 - Liron Cohen, Tansel Uras, T. K. Satish Kumar, Sven Koenig:
Optimal and Bounded-Suboptimal Multi-Agent Motion Planning. SOCS 2019: 44-51 - Vidal Alcázar, Mike Barley, Patricia J. Riddle:
A Theoretical Comparison of the Bounds of MM, NBS, and GBFHS. SOCS 2019: 160-161 - Kalyan Vasudev Alwala, Margarita Safonova, Oren Salzman, Maxim Likhachev:
Intuitive, Reliable Plans with Contingencies: Planning with Safety Nets for Landmark-Based Routing. SOCS 2019: 2-9 - Dor Atzmon, Amit Diei, Daniel Rave:
Multi-Train Path Finding. SOCS 2019: 125-129 - Dor Atzmon, Ariel Felner, Roni Stern:
Probabilistic Robust Multi-Agent Path Finding. SOCS 2019: 162-163 - Roman Barták, Jirí Svancara:
On SAT-Based Approaches for Multi-Agent Path Finding with the Sum-of-Costs Objective. SOCS 2019: 10-17 - Nawal Benabbou, Thibaut Lust:
A General Interactive Approach for Solving Multi-Objective Combinatorial Optimization Problems with Imprecise Preferences. SOCS 2019: 164-165 - Narayan Changder, Samir Aknine, Animesh Dutta:
An Improved Algorithm for Optimal Coalition Structure Generation. SOCS 2019: 166-167 - Jingwei Chen, Nathan R. Sturtevant, William J. Doyle, Wheeler Ruml:
Revisiting Suboptimal Search. SOCS 2019: 18-25 - Chao Chi Cheng, Wheeler Ruml:
Real-Time Heuristic Search in Dynamic Environments. SOCS 2019: 168-169 - Chung-Yao Chuang, Stephen F. Smith:
Learning and Utilizing Interaction Patterns among Neighborhood-Based Heuristics. SOCS 2019: 26-34 - Robert Clausecker, Alexander Reinefeld:
Zero-Aware Pattern Databases with 1-Bit Compression for Sliding Tile Puzzles. SOCS 2019: 35-43 - Liat Cohen, Tal Grinshpoun, Roni Stern:
Assigning Suppliers to Meet a Deadline. SOCS 2019: 170-171 - Bence Cserna, Kevin C. Gall, Wheeler Ruml:
Improved Safe Real-Time Heuristic Search. SOCS 2019: 172-173 - Stefan Edelkamp:
Challenging Human Supremacy in Skat. SOCS 2019: 52-60 - Kai Fieger, Tomás Balyo, Christian Schulz, Dominik Schreiber:
Finding Optimal Longest Paths by Dynamic Programming in Parallel. SOCS 2019: 61-69 - Santiago Franco, Álvaro Torralba:
Interleaving Search and Heuristic Improvement. SOCS 2019: 130-134 - Nils Christian Froleyks, Tomás Balyo, Dominik Schreiber:
PASAR - Planning as Satisfiability with Abstraction Refinement. SOCS 2019: 70-78 - Alfonso Emilio Gerevini, Nir Lipovetzky, Nico Peli, Francesco Percassi, Alessandro Saetti, Ivan Serina:
Novelty Messages Filtering for Multi Agent Privacy-Preserving Plannin. SOCS 2019: 79-87 - Rodrigo N. Gómez, Carlos Hernández, Jorge A. Baier:
Compiling Cost-Optimal Multi-Agent Pathfinding to ASP. SOCS 2019: 174-175 - Alban Grastien:
Brigitte, a Bridge-Based Grid Path-Finder. SOCS 2019: 176-177 - Robert C. Holte, Rubén Majadas, Alberto Pozanco, Daniel Borrajo:
Error Analysis and Correction for Weighted A*'s Suboptimality. SOCS 2019: 135-139 - Jiaoyang Li, Eli Boyarski, Ariel Felner, Hang Ma, Sven Koenig:
Improved Heuristics for Multi-Agent Path Finding with Conflict-Based Search: Preliminary Results. SOCS 2019: 182-183 - Jiaoyang Li, Daniel Harabor, Peter J. Stuckey, Hang Ma, Sven Koenig:
Symmetry-Breaking Constraints for Grid-Based Multi-Agent Path Finding. SOCS 2019: 184-185 - Jiaoyang Li, Pavel Surynek, Ariel Felner, Hang Ma, T. K. Satish Kumar, Sven Koenig:
Multi-Agent Path Finding for Large Agents. SOCS 2019: 186-187 - Majid Namazi, M. A. Hakim Newton, Abdul Sattar, Conrad Sanderson:
A Profit Guided Coordination Heuristic for Travelling Thief Problems. SOCS 2019: 140-144 - Ramkumar Natarajan, Muhammad Suhail Saleem, Sandip Aine, Maxim Likhachev, Howie Choset:
A-MHA*: Anytime Multi-Heuristic A. SOCS 2019: 192-193
skipping 16 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-03-28 23:59 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