Остановите войну!
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 1,370 matches
- 2024
- David Speck, Daniel Gnad:
Decoupled Search for the Masses: A Novel Task Transformation for Classical Planning. ICAPS 2024: 546-554 - Michael Katz, Junkyu Lee, Shirin Sohrabi:
Unifying and Certifying Top-Quality Planning. ICAPS 2024: 319-323 - Eyal Weiss, Ariel Felner, Gal A. Kaminka:
Tightest Admissible Shortest Path. ICAPS 2024: 643-652 - Zhikang Fan, Weiran Shen:
A Fast Algorithm for k-Memory Messaging Scheme Design in Dynamic Environments with Uncertainty. ICAPS 2024: 187-195 - Leonardo Lamanna, Luciano Serafini:
Action Model Learning from Noisy Traces: a Probabilistic Approach. ICAPS 2024: 342-350 - Xiaodi Zhang, Alban Grastien, Charles Gretton:
A Counter-Example Based Approach to Probabilistic Conformant Planning. ICAPS 2024: 689-697 - Han Zhang, Oren Salzman, Ariel Felner, T. K. Satish Kumar, Sven Koenig:
Bounded-Suboptimal Weight-Constrained Shortest-Path Search via Efficient Representation of Paths. ICAPS 2024: 680-688 - Forest Agostinelli, Rojina Panta, Vedant Khandelwal:
Specifying Goals to Deep Neural Networks with Answer Set Programming. ICAPS 2024: 2-10 - Saman Ahmadi, Nathan R. Sturtevant, Daniel Harabor, Mahdi Jalili:
Exact Multi-objective Path Finding with Negative Weights. ICAPS 2024: 11-19 - Gregor Behnke, Marcel Steinmetz:
On the Computational Complexity of Stackelberg Planning and Meta-Operator Verification. ICAPS 2024: 20-24 - Raven Beutner, Bernd Finkbeiner:
Non-deterministic Planning for Hyperproperty Verification. ICAPS 2024: 25-30 - Blai Bonet, Dominik Drexler, Hector Geffner:
On Policy Reuse: An Expressive Language for Representing and Executing General Policies that Call Other Policies. ICAPS 2024: 31-39 - Clemens Büchner, Patrick Ferber, Jendrik Seipp, Malte Helmert:
Abstraction Heuristics for Factored Tasks. ICAPS 2024: 40-49 - Matteo Cardellini, Marco Maratea, Francesco Percassi, Enrico Scala, Mauro Vallati:
Taming Discretised PDDL+ through Multiple Discretisations. ICAPS 2024: 59-67 - Rogelio E. Cardona-Rivera, Arnav Jhala, Julie Porteous, R. Michael Young:
The Story So Far on Narrative Planning. ICAPS 2024: 489-499 - Dillon Z. Chen, Felipe W. Trevizan, Sylvie Thiébaux:
Return to Tradition: Learning Reliable Heuristics with Classical Machine Learning. ICAPS 2024: 68-76 - Xi Chen, Yue Zhang, Yonggang Zhang:
More Flexible Proximity Wildcards Path Planning with Compressed Path Databases. ICAPS 2024: 77-85 - Lukás Chrpa, Erez Karpas:
On Verifying Linear Execution Strategies in Planning Against Nature. ICAPS 2024: 86-94 - Andrew Coles, Erez Karpas, Andrey Lavrinenko, Wheeler Ruml, Solomon Eyal Shimony, Shahaf S. Shperberg:
Planning and Acting While the Clock Ticks. ICAPS 2024: 95-103 - Augusto B. Corrêa, Giuseppe De Giacomo, Malte Helmert, Sasha Rubin:
Planning with Object Creation. ICAPS 2024: 104-113 - Marek Cuchý, Jirí Vokrínek, Michal Jakob:
Multi-Objective Electric Vehicle Route and Charging Planning with Contraction Hierarchies. ICAPS 2024: 114-122 - Magí Dalmau-Moreno, Néstor García, Vicenç Gómez, Hector Geffner:
Combined Task and Motion Planning via Sketch Decompositions. ICAPS 2024: 123-132 - David DeFazio, Yohei Hayamizu, Shiqi Zhang:
Learning Quadruped Locomotion Policies Using Logical Rules. ICAPS 2024: 142-150 - Simon Dold, Malte Helmert:
Higher-Dimensional Potential Heuristics: Lower Bound Criterion and Connection to Correlation Complexity. ICAPS 2024: 151-161 - Jan Eisenhut, Xandra Schuler, Daniel Fiser, Daniel Höller, Maria Christakis, Jörg Hoffmann:
New Fuzzing Biases for Action Policy Testing. ICAPS 2024: 162-167 - Mojtaba Elahi, Saurabh Fadnis, Jussi Rintanen:
Termination Properties of Transition Rules for Indirect Effects. ICAPS 2024: 178-186 - Bowen Fang, Xu Chen, Zhengkun Pan, Xuan Di:
SLAMuZero: Plan and Learn to Map for Joint SLAM and Navigation. ICAPS 2024: 196-200 - Ying Feng, Adittyo Paul, Zhe Chen, Jiaoyang Li:
A Real-Time Rescheduling Algorithm for Multi-robot Plan Execution. ICAPS 2024: 201-209 - Daniel Fiser, Marcel Steinmetz:
Towards Feasible Higher-Dimensional Potential Heuristics. ICAPS 2024: 210-220 - Orso Forghieri, Hind Castel, Emmanuel Hyon, Erwan Le Pennec:
Progressive State Space Disaggregation for Infinite Horizon Dynamic Programming. ICAPS 2024: 221-229
skipping 1,340 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-06-06 04:26 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