![](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 37 matches
- 2013
- Sandip Aine, Maxim Likhachev:
Anytime Truncated D* : Anytime Replanning with Truncation. SOCS 2013: 2-10 - Faten Aljalaud, Nathan R. Sturtevant:
Finding Bounded Suboptimal Multi-Agent Path Planning Solutions Using Increasing Cost Tree Search (Extended Abstract). SOCS 2013: 203-204 - Taha Arbaoui, Jean-Paul Boufflet, Aziz Moukrim:
An Analysis Framework for Examination Timetabling. SOCS 2013: 11-19 - Alejandro Arbelaez, Luis Quesada:
Parallelising the k-Medoids Clustering Problem Using Space-Partitioning. SOCS 2013: 20-28 - Christer Bäckström, Peter Jonsson, Simon Ståhlberg:
Fast Detection of Unsolvable Planning Instances Using Local Consistency. SOCS 2013: 29-37 - Hannah Bast, Sabine Storandt:
Frequency Data Compression for Public Transportation Network Algorithms (Extended Abstract). SOCS 2013: 205-206 - J. Christopher Beck, Gene Cooperman:
Invited Speakers. SOCS 2013 - Zahy Bnaya, Roni Stern, Ariel Felner, Roie Zivan, Steven Okamoto:
Multi-Agent Path Finding for Self Interested Agents. SOCS 2013: 38-46 - Ethan Burns, Scott Kiesel, Wheeler Ruml:
Experimental Real-Time Heuristic Search Results in a Video Game. SOCS 2013: 47-54 - Jan-P. Calliess, Stephen J. Roberts:
Multi-Agent Planning with Mixed-Integer Programming and Adaptive Interaction Constraint Generation (Extended Abstract). SOCS 2013: 207-208 - Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato F. Werneck:
Customizable Route Planning in Road Networks (Extended Abstract). SOCS 2013: 212 - Daniel Delling, Thomas Pajor, Renato F. Werneck:
Round-Based Public Transit Routing (Extended Abstract). SOCS 2013: 213 - John Paul Dickerson, Tuomas Sandholm:
Throwing Darts: Random Sampling Helps Tree Search when the Number of Short Certificates Is Moderate. SOCS 2013: 55-62 - Carmel Domshlak, Zohar Feldman:
To UCT, or not to UCT? (Position Paper). SOCS 2013: 63-70 - Florian Drews, Dennis Luxen:
Multi-Hop Ride Sharing. SOCS 2013: 71-79 - Stefan Funke, Sabine Storandt:
Polynomial-Time Construction of Contraction Hierarchies for Multi-Criteria Objectives. SOCS 2013: 214-215 - Lucie Galand, Anisse Ismaili, Patrice Perny, Olivier Spanjaard:
Bidirectional Preference-Based Search for State Space Graph Problems. SOCS 2013: 80-88 - Meir Goldenberg, Ariel Felner, Nathan R. Sturtevant, Robert C. Holte, Jonathan Schaeffer:
Optimal-Generation Variants of EPEA. SOCS 2013: 89-97 - Matthew Hatem, Roni Stern, Wheeler Ruml:
Bounded Suboptimal Heuristic Search in Linear Space. SOCS 2013: 98-104 - Malte Helmert, Gabriele Röger:
SoCS 2013 Organization. SOCS 2013 - Malte Helmert, Gabriele Röger:
Preface. SOCS 2013 - Michael Katz, Jörg Hoffmann:
Red-Black Relaxed Plan Heuristics Reloaded. SOCS 2013: 105-113 - Athanasios Krontiris, Ryan Luna, Kostas E. Bekris:
From Feasibility Tests to Path Planners for Multi-Agent Pathfinding. SOCS 2013: 114-122 - Levi H. S. Lelis:
Active Stratified Sampling with Clustering-Based Type Systems for Predicting the Search Tree Size of Problems with Real-Valued Heuristics. SOCS 2013: 123-132 - Carlos Linares López, Roni Stern, Ariel Felner:
Target-Value Search Revisited (Extended Abstract). SOCS 2013: 216-217 - Dennis Luxen, Dennis Schieferdecker:
Candidate Sets for Alternative Routes in Road Networks (Extended Abstract). SOCS 2013: 218-219 - Yuri Malitsky, Deepak Mehta, Barry O'Sullivan:
Evolving Instance Specific Algorithm Configuration. SOCS 2013: 133-140 - André Grahl Pereira, Marcus Ritt, Luciana Salete Buriol:
Finding Optimal Solutions to Sokoban Using Instance Dependent Pattern Databases. SOCS 2013: 141-148 - Naina Razakarison, Mats Carlsson, Nicolas Beldiceanu, Helmut Simonis:
GAC for a Linear Inequality and an Atleast Constraint with an Application to Learning Simple Polynomials. SOCS 2013: 149-157 - Nicolas Rivera, Leon Illanes, Jorge A. Baier, Carlos Hernández:
Reconnecting with the Ideal Tree: An Alternative to Heuristic Learning in Real-Time Search. SOCS 2013: 158-166
skipping 7 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-08-24 21:21 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