Остановите войну!
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 62 matches
- 2006
- Salwani Abdullah, Edmund K. Burke:
A Multi-Start Very Large Neighbourhood Search Approach with Local Search Methods for Examination Timetabling. ICAPS 2006: 334-337 - Rama Akkiraju, Biplav Srivastava, Anca-Andreea Ivan, Richard Goodwin, Tanveer Fathima Syeda-Mahmood:
SEMAPLAN: Combining Planning with Semantic Matching to Achieve Web Service Composition. ICAPS 2006: 338-341 - Alexandre Albore, Piergiorgio Bertoli:
Safe LTL Assumption-Based Planning. ICAPS 2006: 193-202 - Ruth Aylett, João Dias, Ana Paiva:
An Affectively Driven Planner for Synthetic Characters. ICAPS 2006: 2-10 - Jorge A. Baier, Sheila A. McIlraith:
Planning with Temporally Extended Goals Using Heuristic Search. ICAPS 2006: 342-345 - Fabio Barbon, Paolo Traverso, Marco Pistore, Michele Trainotti:
Run-Time Monitoring of the Execution of Plans for Web Service Composition. ICAPS 2006: 346-349 - Roman Barták, Ondrej Cepek:
Incremental Maintenance of Double Precedence Graphs: A Constraint-Based Approach. ICAPS 2006: 350-353 - J. Christopher Beck:
An Empirical Study of Multi-Point Constructive Search for Constraint-Based Scheduling. ICAPS 2006: 274-283 - Piergiorgio Bertoli, Alessandro Cimatti, Marco Pistore:
Towards Strong Cyclic Planning under Partial Observability. ICAPS 2006: 354-357 - Piergiorgio Bertoli, Marco Pistore, Paolo Traverso:
Automated Web Service Composition by On-the-Fly Belief Space Search. ICAPS 2006: 358-361 - Blai Bonet:
Bounded Branching and Modalities in Non-Deterministic Planning. ICAPS 2006: 42-51 - Blai Bonet, Hector Geffner:
Learning Depth-First Search: A Unified Approach to Heuristic Search in Deterministic and Non-Deterministic Settings, and Its Application to MDPs. ICAPS 2006: 142-151 - Daniel Bryce, Subbarao Kambhampati, David E. Smith:
Sequential Monte Carlo in Probabilistic Planning Reachability Heuristics. ICAPS 2006: 233-242 - Daniel Burfoot, Joelle Pineau, Gregory Dudek:
RRT-Plan: A Randomized Algorithm for STRIPS Planning. ICAPS 2006: 362-365 - Canan Özgen, Aysenur Birtürk:
Motion Economy and Planning. ICAPS 2006: 366-369 - Luis A. Castillo, Juan Fernández-Olivares, Óscar García-Pérez, Francisco Palao:
Efficiently Handling Temporal Knowledge in an HTN Planner. ICAPS 2006: 63-72 - Allen Chang, Eyal Amir:
Goal Achievement in Partially Known, Partially Observable Domains. ICAPS 2006: 203-211 - Gabriella Cortellessa, Amedeo Cesta:
Evaluating Mixed-Initiative Systems: An Experimental Approach. ICAPS 2006: 172-181 - Minh Binh Do, Wheeler Ruml:
Lessons Learned in Applying Domain-Independent Planning to High-Speed Manufacturing. ICAPS 2006: 370-373 - Carmel Domshlak, Jörg Hoffmann:
Fast Probabilistic Planning through Weighted Model Counting. ICAPS 2006: 243-252 - Stefan Edelkamp:
On the Compilation of Plan Constraints and Preferences. ICAPS 2006: 374-377 - Juan Fernández-Olivares, Luis A. Castillo, Óscar García-Pérez, Francisco Palao:
Bringing Users and Planning Technology Together. Experiences in SIADEX. ICAPS 2006: 11-20 - Fernando Fernández, Manuela M. Veloso:
Reusing and Building a Policy Library. ICAPS 2006: 378-381 - Maria Fox, Alfonso Gerevini, Derek Long, Ivan Serina:
Plan Stability: Replanning versus Plan Repair. ICAPS 2006: 212-221 - Jeremy Frank, James Crawford, Lina Khatib, Ronen I. Brafman:
Tractable Optimal Competitive Scheduling. ICAPS 2006: 73-82 - Anthony Gallagher, Terry L. Zimmerman, Stephen F. Smith:
Incremental Scheduling to Maximize Quality in a Dynamic Environment. ICAPS 2006: 222-232 - Robert P. Goldman:
Durative Planning in HTNs. ICAPS 2006: 382-385 - Malte Helmert:
New Complexity Results for Classical Planning Benchmarks. ICAPS 2006: 52-62 - Jörg Hoffmann, Carla P. Gomes, Bart Selman:
Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning. ICAPS 2006: 284-293 - Jörg Hoffmann, Ashish Sabharwal, Carmel Domshlak:
Friends or Foes? An AI Planning Perspective on Abstraction and Search. ICAPS 2006: 294-303
skipping 32 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-24 17:55 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