Остановите войну!
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 43 matches
- 2023
- Michael Katz, Junkyu Lee, Shirin Sohrabi:
Generating SAS+ Planning Tasks of Specified Causal Structure. SOCS 2023: 29-37 - Junkyu Lee, Michael Katz, Shirin Sohrabi:
On K* Search for Top-K Planning. SOCS 2023: 38-46 - Eyal Weiss:
A Generalization of the Shortest Path Problem to Graphs with Multiple Edge-Cost Estimates (Student Abstract). SOCS 2023: 206-207 - Michael Katz, Junkyu Lee:
K∗ and Partial Order Reduction for Top-Quality Planning. SOCS 2023: 143-147 - Ryo Kuroiwa:
Domain-Independent Dynamic Programming (Student Abstract). SOCS 2023: 192-193 - Ruth Helen Bergin, Marco Dalla, Andrea Visentin, Barry O'Sullivan, Gregory M. Provan:
Using Machine Learning Classifiers in SAT Branching [Extended Abstract]. SOCS 2023: 169-170 - Adi Botea, Vadim Bulitko:
Core Expansion in Optimization Crosswords. SOCS 2023: 2-10 - Shao-Hung Chan, Roni Stern, Ariel Felner, Sven Koenig:
Greedy Priority-Based Search for Suboptimal Multi-Agent Path Finding. SOCS 2023: 11-19 - Marco Dalla, Benjamin Provan-Bessell, Andrea Visentin, Barry O'Sullivan:
SAT Feature Analysis for Machine Learning Classification Tasks. SOCS 2023: 138-142 - David Fairbairn:
Multi-Agent Path-Finding and Algorithmic Graph Theory (Student Abstract). SOCS 2023: 190-191 - Tzvika Geft:
Fine-Grained Complexity Analysis of Multi-Agent Path Finding on 2D Grids. SOCS 2023: 20-28 - Marc-Emmanuel Coupvent des Graviers, Kevin Osanlou, Christophe Guettier, Tristan Cazenave:
Hybrid Search with Graph Neural Networks for Constraint-Based Navigation Planning [Extended Abstract]. SOCS 2023: 171-172 - Chao Lei, Nir Lipovetzky, Krista A. Ehinger:
Novelty and Lifted Helpful Actions in Generalized Planning. SOCS 2023: 148-152 - Jonathan Morag, Roni Stern, Ariel Felner:
Adapting to Planning Failures in Lifelong Multi-Agent Path Finding. SOCS 2023: 47-55 - Shohin Mukherjee, Maxim Likhachev:
GePA*SE: Generalized Edge-Based Parallel A* for Slow Evaluations. SOCS 2023: 153-157 - Thomas K. Nobes:
Pipe-Routing and Pathfinding in 3D (Student Abstract). SOCS 2023: 194-195 - Thomas K. Nobes, Daniel Harabor, Michael Wybrow, Stuart D. C. Walsh:
Voxel Benchmarks for 3D Pathfinding: Sandstone, Descent, and Industrial Plants. SOCS 2023: 56-64 - Andrii Nyporko, Lukás Chrpa:
Towards an Effective Framework Combining Planning and Scheduling [Extended Abstract]. SOCS 2023: 173-174 - Conny Olz, Pascal Bercher:
A Look-Ahead Technique for Search-Based HTN Planning: Reducing the Branching Factor by Identifying Inevitable Task Refinements. SOCS 2023: 65-73 - Alison Paredes:
Structural Bias in Heuristic Search (Student Abstract). SOCS 2023: 196-197 - Adittyo Paul, Ying Feng, Jiaoyang Li:
A Fast Rescheduling Algorithm for Real-Time Multi-Robot Coordination [Extended Abstract]. SOCS 2023: 175-176 - Francesco Percassi, Enrico Scala, Mauro Vallati:
On the Notion of Fixability of PDDL+ Plans [Extended Abstract]. SOCS 2023: 177-178 - Wiktor Piotrowski, Yoni Sher, Sachin Grover, Roni Stern, Shiwali Mohan:
Heuristic Search for Physics-Based Problems: Angry Birds in PDDL+ [Extended Abstract]. SOCS 2023: 179-180 - Zhongqiang Ren, Sivakumar Rathinam, Howie Choset:
Search Algorithms for Multi-Agent Teamwise Cooperative Path Finding [Extended Abstract]. SOCS 2023: 181-182 - Enrico Saccon:
Multi-Agent Open Framework: Developing a Holistic System to Solve MAPF (Student Abstract). SOCS 2023: 198-199 - Bojie Shen:
Tracking Progress in Multi-Agent Path Finding (Student Abstract). SOCS 2023: 200-201 - Takumi Shimoda, Alex Fukunaga:
Improved Exploration of the Bench Transition System in Parallel Greedy Best First Search. SOCS 2023: 74-82 - Lior Siag, Shahaf S. Shperberg, Ariel Felner, Nathan R. Sturtevant:
Comparing Front-to-Front and Front-to-End Heuristics in Bidirectional Search. SOCS 2023: 158-162 - Shawn Skyler, Shahaf S. Shperberg, Dor Atzmon, Ariel Felner, Oren Salzman, Shao-Hung Chan, Han Zhang, Sven Koenig, William Yeoh, Carlos Hernández Ulloa:
Must-Expand Nodes in Multi-Objective Search [Extended Abstract]. SOCS 2023: 183-184 - Václav Sobotka:
Uncertainty and Dynamicity in Real-World Vehicle Routing (Student Abstract). SOCS 2023: 202-203
skipping 13 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-05-08 10:55 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