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 19 matches
- 2000
- Luis A. Castillo, Juan Fernández-Olivares, Antonio González Muñoz:
A hybrid hierarchical operator-based planning approach for the design of control programs. PuK 2000 - Carmel Domshlak, Ronen I. Brafman:
Strucutre and Complexity in Planning with Unary Operators. PuK 2000 - Stefan Edelkamp:
Heuristic Search Planning with BDDs. PuK 2000 - Patrick Fabiani, Yannick Meiller:
Planning with tokens: an approach between satisfaction and optimisation. PuK 2000 - Antonio Garrido Tejero, Miguel A. Salido, Federico Barber:
Scheduling in a Planning Environment. PuK 2000 - Antonio Garrido Tejero, Miguel A. Salido, Federico Barber, Montserrat Abril López:
Heuristic Methods for Solving Job-Shop Scheduling Problems. PuK 2000 - Emmanuel Guere, Rachid Alami:
An Accessibility graph learning approach for task planning in large domains. PuK 2000 - Harald Meyer auf'm Hofe:
Benefits and Problems of using cycle-cutset within interative improvement algorithms. PuK 2000 - Jörg Hoffmann:
A Heuristic for Domain Independent Planning and its Use in an Enforced Hill-climbing Algorithm. PuK 2000 - Bernhard Jung, Mathias Nousch:
Design and Configuration of Furniture Using Internet-based Virtual Reality Techniques. PuK 2000 - Jana Koehler, Jörg Hoffmann:
On the Instantiation of ADL Operators Involving Arbitrary First-Order Formulas. PuK 2000 - Ingo Kreuz:
Considering the Dynamic in Knowledge Based Configuration. PuK 2000 - Christian Kühn:
Modeling Strucutre and Behaviour for Knowledge Based Software Configuration. PuK 2000 - Jun Miura, Yoshiaki Shirai:
Knowledge-Based Control of Decision Theoretic Planning - Adaptive Planning Model Selection. PuK 2000 - Eva Onaindia, Laura Sebastia, Eliseo Marzal:
4SP: A four stage incremental planning approach. PuK 2000 - Jürgen Sauer, Tammo Freese, Thorsten Teschke:
Towards agent-based multi-site scheduling. PuK 2000 - Ron M. Simpson, Thomas Leo McCluskey, Donghong Liu:
OCL-Graph: Exploiting Object Structure in a Plan Graph Algorithm. PuK 2000 - Shlomo Zilberstein, Abdel-Illah Mouaddib, Andrew Arnt:
Dynamic Scheduling of Progressive Processing Plans. PuK 2000 - Proceedings of the 14th Workshop "New Results in Planning, Scheduling and Design" (PuK2000), Berlin, 21-22 August 2000. 2000 [contents]
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-11-09 07:49 CET 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