Остановите войну!
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 34 matches
- 2005
- Russell Bent, Pascal Van Hentenryck:
Online Stochastic Optimization Without Distributions. ICAPS 2005: 171-180 - Mark S. Boddy, Johnathan Gohde, Thomas Haigh, Steven A. Harp:
Course of Action Generation for Cyber Security Using Classical Planning. ICAPS 2005: 12-21 - Adi Botea, Martin Müller, Jonathan Schaeffer:
Learning Partial-Order Macros from Solutions. ICAPS 2005: 231-240 - Ronen I. Brafman, Yuri Chernyavsky:
Planning with Goal Preferences and Constraints. ICAPS 2005: 182-191 - John L. Bresina, Ari K. Jónsson, Paul H. Morris, Kanna Rajan:
Activity Planning for the Mars Exploration Rovers. ICAPS 2005: 40-49 - Alexandru Horia Brie, Philippe Morignot:
Genetic Planning Using Variable Length Chromosomes. ICAPS 2005: 320-329 - Menkes van den Briel, Thomas Vossen, Subbarao Kambhampati:
Reviving Integer Programming Approaches for AI Planning: A Branch-and-Cut Framework. ICAPS 2005: 310-319 - Markus Büttner, Jussi Rintanen:
Satisfiability Planning with Constraints on the Number of Actions. ICAPS 2005: 292-299 - Michael T. Cox, Chen Zhang:
Planning as Mixed-Initiative Goal Manipulation. ICAPS 2005: 282-291 - Stefan Edelkamp:
External Symbolic Heuristic Search with Pattern Databases. ICAPS 2005: 51-60 - Daniel Godard, Philippe Laborie, Wim Nuijten:
Randomized Large Neighborhood Search for Cumulative Scheduling. ICAPS 2005: 81-89 - Pascal Van Hentenryck, Yannis Vergados:
Minimizing Breaks in Sport Scheduling with Local Search. ICAPS 2005: 22-29 - Jörg Hoffmann, Ronen I. Brafman:
Contingent Planning via Heuristic Forward Search witn Implicit Belief States. ICAPS 2005: 71-80 - Froduald Kabanza, Sylvie Thiébaux:
Search Control in Planning for Temporally Extended Goals. ICAPS 2005: 130-139 - Laurence A. Kramer, Stephen F. Smith:
Maximizing Availability: A Commitment Heuristic for Oversubscribed Scheduling Problems. ICAPS 2005: 272-280 - Roman van der Krogt, Mathijs de Weerdt:
Plan Repair as an Extension of Planning. ICAPS 2005: 161-170 - T. K. Satish Kumar:
On the Tractability of Restricted Disjunctive Temporal Problems. ICAPS 2005: 110-119 - Ugur Kuter, Dana S. Nau, Marco Pistore, Paolo Traverso:
A Hierarchical Task-Network Planner based on Symbolic Model Checking. ICAPS 2005: 300-309 - Maxim Likhachev, David I. Ferguson, Geoffrey J. Gordon, Anthony Stentz, Sebastian Thrun:
Anytime Dynamic A*: An Anytime, Replanning Algorithm. ICAPS 2005: 262-271 - Maxim Likhachev, Sven Koenig:
A Generalized Framework for Lifelong Planning A* Search. ICAPS 2005: 99-108 - Mausam, Daniel S. Weld:
Concurrent Probabilistic Temporal Planning. ICAPS 2005: 120-129 - H. Brendan McMahan, Geoffrey J. Gordon:
Fast Exact Planning in Markov Decision Processes. ICAPS 2005: 151-160 - Proshanto Mukherji, Lenhart K. Schubert:
Discovering Planning Invariants as Anomalies in State Descriptions. ICAPS 2005: 223-230 - Romeo Sanchez Nigenda, Subbarao Kambhampati:
Planning Graph Heuristics for Selecting Objectives in Over-subscription Planning Problems. ICAPS 2005: 192-201 - Héctor Palacios, Blai Bonet, Adnan Darwiche, Hector Geffner:
Pruning Conformant Plans by Counting Models on Compiled d-DNNF Representations. ICAPS 2005: 141-150 - Bart Peintner, Michael D. Moffitt, Martha E. Pollack:
Solving Over-constrained Disjunctive Temporal Problems with Preferences. ICAPS 2005: 202-211 - Marco Pistore, Paolo Traverso, Piergiorgio Bertoli:
Automated Composition of Web Services by Planning in Asynchronous Domains. ICAPS 2005: 2-11 - Wheeler Ruml, Minh Binh Do, Markus P. J. Fromherz:
On-line Planning and Scheduling for High-speed Manufacturing. ICAPS 2005: 30-39 - I-Hsiang Shu, Robert T. Effinger, Brian Charles Williams:
Enabling Fast Flexible Planning through Incremental Temporal Reasoning with Conflict Extraction. ICAPS 2005: 252-261 - Matthew J. Streeter, Stephen F. Smith:
Charecterizing the Distribution of Low-Makespan Schedules in the Job Shop Scheduling Problem. ICAPS 2005: 61-70
skipping 4 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-28 21:53 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