![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
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 54 matches
- 2021
- Hang Ma:
Extended Abstract: A Competitive Analysis of Online Multi-Agent Path Finding. SOCS 2021: 182-184 - Jiaoyang Li, Zhe Chen, Yi Zheng, Shao-Hung Chan, Daniel Harabor, Peter J. Stuckey, Hang Ma, Sven Koenig:
Scalable Rail Planning and Replanning: Winning the 2020 Flatland Challenge. SOCS 2021: 179-181 - Ishani Chatterjee, Tushar Kusnur, Maxim Likhachev:
Fast Bounded Suboptimal Probabilistic Planning with Clear Preferences on Missing Information. SOCS 2021: 37-45 - Roberto Javier Asín Achá, Rodrigo López, Sebastián Hagedorn, Jorge A. Baier:
A New Boolean Encoding for MAPF and its Performance with ASP and MaxSAT Solvers. SOCS 2021: 11-19 - Saman Ahmadi, Guido Tack, Daniel Harabor, Philip Kilby:
Bi-Objective Search with Bi-directional A* (Extended Abstract). SOCS 2021: 142-144 - Anton Andreychuk, Konstantin S. Yakovlev, Eli Boyarski, Roni Stern:
Improving Continuous-time Conflict Based Search. SOCS 2021: 145-146 - Pablo Araneda, Matias Greco, Jorge A. Baier:
Exploiting Learned Policies in Focal Search. SOCS 2021: 2-10 - Dor Atzmon, Shahar Idan Freiman, Oscar Epshtein, Oran Shichman, Ariel Felner:
Conflict-Free Multi-Agent Meeting. SOCS 2021: 147-149 - Roman Barták, Marika Ivanová, Jirí Svancara
:
From Classical to Colored Multi-Agent Path Finding. SOCS 2021: 150-152 - Abhinav Bhatia, Justin Svegliato, Shlomo Zilberstein:
On the Benefits of Randomly Adjusting Anytime Weighted A. SOCS 2021: 116-120 - Adi Botea, Vadim Bulitko:
Scaling Up Search with Partial Initial States in Optimization Crosswords. SOCS 2021: 20-27 - Adi Botea, Massimiliano Mattetti, Akihiro Kishimoto, Radu Marinescu, Elizabeth Daly:
Counting Vertex-Disjoint Shortest Paths in Graphs. SOCS 2021: 28-36 - Eli Boyarski, Ariel Felner, Pierre Le Bodic, Daniel Harabor, Peter J. Stuckey, Sven Koenig:
Further Improved Heuristics For Conflict-Based Search. SOCS 2021: 213-215 - Martin Capek, Pavel Surynek:
DPLL(MAPF): an Integration of Multi-Agent Path Finding and SAT Solving Technologies. SOCS 2021: 153-155 - Matteo Cardellini, Marco Maratea, Mauro Vallati, Gianluca Boleto, Luca Oneto:
A Planning-based Approach for In-Station Train Dispatching. SOCS 2021: 156-158 - Shao-Hung Chan, Jiaoyang Li, Graeme Gange, Daniel Harabor, Peter J. Stuckey, Sven Koenig:
ECBS with Flex Distribution for Bounded-Suboptimal Multi-Agent Path Finding. SOCS 2021: 159-161 - Jingwei Chen, Nathan R. Sturtevant:
Avoiding Re-expansions in Suboptimal Best-First Search. SOCS 2021: 162-163 - Jingkai Chen, Yuening Zhang, Cheng Fang, Brian C. Williams:
Generalized Conflict-Directed Search for Optimal Ordering Problems. SOCS 2021: 46-54 - Lukás Chrpa, Pavel Rytír
, Rostislav Horcík, Jan Cuhel, Anastasiia Livochka, Stefan Edelkamp:
Adversary Strategy Sampling for Effective Plan Generation. SOCS 2021: 164-166 - Robert Clausecker, Florian Schintke:
A Measure of Quality for IDA* Heuristics. SOCS 2021: 55-63 - Amihay Elboher, Shahaf S. Shperberg, Solomon Eyal Shimony:
Metareasoning for Interleaved Planning and Execution. SOCS 2021: 167-169 - Ariel Felner, Shahaf S. Shperberg, Hadar Buzhish:
The Closed List is an Obstacle Too. SOCS 2021: 121-125 - Aaron M. Ferber, Jialin Song, Bistra Dilkina, Yisong Yue:
Learning Pseudo-Backdoors for Mixed Integer Programs. SOCS 2021: 170-172 - Ofir Gordon, Yuval Filmus, Oren Salzman:
Revisiting the Complexity Analysis of Conflict-Based Search: New Computational Techniques and Improved Bounds. SOCS 2021: 64-72 - Matias Greco:
Exploiting Learned Policies and Learned Heuristics in Bounded-Suboptimal Search. SOCS 2021: 219-221 - Nir Greshler, Ofir Gordon, Oren Salzman, Nahum Shimkin:
Cooperative Multi-Agent Path Finding: Beyond Path Planning and Collision Avoidance. SOCS 2021: 173-175 - Tianyi Gu:
Distributional Metareasoning for Heuristic Search. SOCS 2021: 222-224 - Ryan Hechenberger, Daniel Harabor, Muhammad Aamir Cheema, Peter J. Stuckey, Pierre Le Bodic:
Multi-Target Search in Euclidean Space with Ray Shooting. SOCS 2021: 176-178 - Sergio Poo Hernandez, Vadim Bulitko:
Speeding Up Heuristic Function Synthesis via Extending the Formula Grammar. SOCS 2021: 233-235 - Omri Kaduri, Eli Boyarski, Roni Stern:
Experimental Evaluation of Classical Multi Agent Path Finding Algorithms. SOCS 2021: 126-130
skipping 24 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-06-30 19:54 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