Остановите войну!
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 61 matches
- 2022
- Michael Katz, Gabriele Röger, Malte Helmert:
On Producing Shortest Cost-Optimal Plans. SOCS 2022: 100-108 - Javier Segovia Aguas, Sergio Jiménez Celorrio, Laura Sebastiá, Anders Jonsson:
Scaling-Up Generalized Planning as Heuristic Search with Landmarks. SOCS 2022: 171-179 - Saman Ahmadi, Guido Tack, Daniel Harabor, Philip Kilby:
Weight Constrained Path Finding with Bidirectional A. SOCS 2022: 2-10 - Jorge A. Baier, Nicolás Rivera, Carlos Hernández Ulloa:
Subset Approximation of Pareto Regions with Bi-Objective A* (Extended Abstract). SOCS 2022: 255-257 - Eli Boyarski, Shao-Hung Chan, Dor Atzmon, Ariel Felner, Sven Koenig:
On Merging Agents in Multi-Agent Pathfinding Algorithms. SOCS 2022: 11-19 - Zhaoxing Bu, Richard E. Korf:
Iterative-Deepening Uniform-Cost Heuristic Search. SOCS 2022: 20-28 - Vadim Bulitko, Shuwei Wang, Justin Stevens, Levi H. S. Lelis:
Portability and Explainability of Synthesized Formula-based Heuristics. SOCS 2022: 29-37 - Nikhil Chandak, Kenny Chour, Sivakumar Rathinam, R. Ravi:
Informed Steiner Trees: Sampling and Pruning for Multi-Goal Path Finding in High Dimensions (Extended Abstract). SOCS 2022: 258-260 - Zhe Chen, Jiaoyang Li, Daniel Harabor, Peter J. Stuckey, Sven Koenig:
Multi-Train Path Finding Revisited. SOCS 2022: 38-46 - Adil Chhabra, Marcelo Fonseca Faraj, Christian Schulz:
Local Motif Clustering via (Hyper)Graph Partitioning. SOCS 2022: 261-263 - Lukás Chrpa, Pavel Rytír, Andrii Nyporko, Rostislav Horcík, Stefan Edelkamp:
Effective Planning in Resource-Competition Problems by Task Decomposition. SOCS 2022: 47-55 - Vianney Coppé, Pierre Schaus:
A Conflict Avoidance Table for Continuous Conflict-Based Search (Extended Abstract). SOCS 2022: 264-266 - Gal Dahan, Itay Tabib, Solomon Eyal Shimony, Ariel Felner:
Generalized Longest Path Problems. SOCS 2022: 56-64 - Xuzhe Dang, Lukás Chrpa, Stefan Edelkamp:
Deep RRT. SOCS 2022: 333-335 - Manash Pratim Das, Damon M. Conover, Sungmin Eum, Heesung Kwon, Maxim Likhachev:
MA3: Model-Accuracy Aware Anytime Planning with Simulation Verification for Navigating Complex Terrains. SOCS 2022: 65-73 - Ali Davoodi, Mark Wallace, Daniel Harabor:
Fast Traffic Assignment by Focusing on Changing Edge Flows (Extended Abstract). SOCS 2022: 267-269 - Zuzana Fílová, Pavel Surynek:
Lazy Compilation in Classical Planning (Extended Abstract). SOCS 2022: 270-272 - Nikolaus Frohner, Jan Gmys, Nouredine Melab, Günther R. Raidl, El-Ghazali Talbi:
Parallel Beam Search for Combinatorial Optimization (Extended Abstract). SOCS 2022: 273-275 - Chao Gao, Jingwei Chen, Tong Mo, Tanvir Sajed, Shangling Jui, Min Qin, Laiyuan Gong, Wei Lu:
A Memory-Bounded Best-First Beam Search and Its Application to Scheduling Halide Programs. SOCS 2022: 74-82 - Alfonso Emilio Gerevini, Nir Lipovetzky, Francesco Percassi, Alessandro Saetti, Ivan Serina:
On the Use of Width-Based Search for Multi Agent Privacy-Preserving Planning (Extended Abstract). SOCS 2022: 276-278 - Matias Greco, Pablo Araneda, Jorge A. Baier:
Focal Discrepancy Search for Learned Heuristics (Extended Abstract). SOCS 2022: 282-284 - Matias Greco, Jorge A. Baier:
Avoiding Errors in Learned Heuristics in Bounded-Suboptimal Search. SOCS 2022: 336-338 - Matias Greco, Jorge Toro, Carlos Hernández Ulloa, Jorge A. Baier:
K-Focal Search for Slow Learned Heuristics (Extended Abstract). SOCS 2022: 279-281 - Tianyi Gu, Wheeler Ruml, Shahaf S. Shperberg, Solomon Eyal Shimony, Erez Karpas:
When to Commit to an Action in Online Planning and Search. SOCS 2022: 83-90 - Daniel Harabor, Ryan Hechenberger, Thomas Jahn:
Benchmarks for Pathfinding Search: Iron Harvest. SOCS 2022: 218-222 - Ryan Hechenberger, Peter J. Stuckey, Pierre Le Bodic, Daniel Damir Harabor:
Dual Euclidean Shortest Path Search (Extended Abstract). SOCS 2022: 285-287 - Daniel Heller, Patrick Ferber, Julian Bitterwolf, Matthias Hein, Jörg Hoffmann:
Neural Network Heuristic Functions: Taking Confidence into Account. SOCS 2022: 223-228 - Irene Hiess, Ludwig Kampel, Michael Wagner, Dimitris E. Simos:
IPO-MAXSAT: Combining the In-Parameter-Order Strategy for Covering Array Generation with MaxSAT Solving (Extended Abstract). SOCS 2022: 288-290 - Kilian Hu, David Speck:
On Bidirectional Heuristic Search in Classical Planning: An Analysis of BAE. SOCS 2022: 91-99 - Franc Ivankovic, Mauro Vallati, Lukás Chrpa, Marco Roveri:
Urban Traffic Control via Planning with Global State Constraints (Extended Abstract). SOCS 2022: 291-293
skipping 31 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-04-25 20:57 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