Остановите войну!
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 46 matches
- 2007
- Yasmina Abdeddaïm, Eugene Asarin, Matthieu Gallien, Félix Ingrand, Charles Lesire, Mihaela Sighireanu:
Planning Robust Temporal Plans: A Comparison Between CBTP and TGA Approaches. ICAPS 2007: 2-9 - Douglas Aberdeen, Olivier Buffet:
Concurrent Probabilistic Temporal Planning with Policy-Gradients. ICAPS 2007: 10-17 - Raghav Aras, Alain Dutech, François Charpillet:
Mixed Integer Linear Programming for Exact Finite-Horizon Planning in Decentralized Pomdps. ICAPS 2007: 18-25 - Jorge A. Baier, Christian Fritz, Sheila A. McIlraith:
Exploiting Procedural Domain Control Knowledge in State-of-the-Art Planners. ICAPS 2007: 26-33 - J. Benton, Menkes van den Briel, Subbarao Kambhampati:
A Hybrid Linear Programming and Relaxed Plan Heuristic for Partial Satisfaction Planning Problems. ICAPS 2007: 34-41 - Olivier Buffet, Douglas Aberdeen:
FF + FPG: Guiding a Policy-Gradient Planner. ICAPS 2007: 42-48 - Vadim Bulitko, Yngvi Björnsson, Mitja Lustrek, Jonathan Schaeffer, Sverrir Sigmundarson:
Dynamic Control in Path-Planning with Real-Time Heuristic Search. ICAPS 2007: 49-56 - Amedeo Cesta, Gabriella Cortellessa, Simone Fratini, Angelo Oddi, Nicola Policella:
An Innovative Product for Space Mission Planning: An A Posteriori Evaluation. ICAPS 2007: 57-64 - Hei Chan, Alan Fern, Soumya Ray, Nick Wilson, Chris Ventura:
Online Planning for Resource Production in Real-Time Strategy Games. ICAPS 2007: 65-72 - Hubie Chen, Omer Giménez:
Act Local, Think Global: Width Notions for Tractable Planning. ICAPS 2007: 73-80 - Andrew Coles, Maria Fox, Derek Long, Amanda Smith:
Planning with Respect to an Existing Schedule of Events. ICAPS 2007: 81-88 - Andrew Coles, Maria Fox, Amanda Smith:
A New Local-Search Algorithm for Forward-Chaining Planning. ICAPS 2007: 89-96 - Andrew Coles, Maria Fox, Amanda Smith:
Online Identification of Useful Macro-Actions for Planning. ICAPS 2007: 97-104 - William Cushing, Daniel S. Weld, Subbarao Kambhampati, Mausam, Kartik Talamadupula:
Evaluating Temporal Planning Domains. ICAPS 2007: 105-112 - Peng Dai, Eric A. Hansen:
Prioritizing Bellman Backups without a Priority Queue. ICAPS 2007: 113-119 - Anders Dohn, Esben Kolind, Jens Clausen:
The Manpower Allocation Problem with Time Windows and Job-Teaming Constraints. ICAPS 2007: 120-127 - Stefan Edelkamp, Shahid Jabbar, Blai Bonet:
External Memory Value Iteration. ICAPS 2007: 128-135 - Jeremy Frank, Paul H. Morris:
Bounding the Resource Availability of Activities with Linear Resource Impact. ICAPS 2007: 136-143 - Christian Fritz, Sheila A. McIlraith:
Monitoring Plan Optimality During Execution. ICAPS 2007: 144-151 - Omer Giménez, Anders Jonsson:
On the Hardness of Planning Problems with Simple Causal Graphs. ICAPS 2007: 152-159 - Mark E. Giuliano, Reiko Rager, Nazma Ferdous:
Towards a Heuristic for Scheduling the James Webb Space Telescope. ICAPS 2007: 160-167 - Charles Gretton:
Gradient-Based Relational Reinforcement Learning of Temporally Extended Policies. ICAPS 2007: 168-175 - Malte Helmert, Patrik Haslum, Jörg Hoffmann:
Flexible Abstraction Heuristics for Optimal Sequential Planning. ICAPS 2007: 176-183 - David W. Hildum, Stephen F. Smith:
Constructing Conflict-Free Schedules in Space and Time. ICAPS 2007: 184-191 - Yuxiao Hu:
Temporally-Expressive Planning as Constraint Satisfaction Problems. ICAPS 2007: 192-199 - Michael Katz, Carmel Domshlak:
Structural Patterns of Tractable Sequentially-Optimal Planning. ICAPS 2007: 200-207 - Hoong Chuin Lau, Thomas Ou, Fei Xiao:
Robust Local Search and Its Application to Generating Robust Schedules. ICAPS 2007: 208-215 - Benjamin Lussier, Matthieu Gallien, Jérémie Guiochet, Félix Ingrand, Marc-Olivier Killijian, David Powell:
Planning with Diversified Models for Fault-Tolerant Robots. ICAPS 2007: 216-223 - Sridhar Mahadevan, Sarah Osentoski, Jeffrey Johns, Kimberly Ferguson, Chang Wang:
Learning to Plan Using Harmonic Analysis of Diffusion Models. ICAPS 2007: 224-231 - Bhaskara Marthi, Stuart Russell, Jason Andrew Wolfe:
Angelic Semantics for High-Level Actions. ICAPS 2007: 232-239
skipping 16 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-23 04:33 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