173 search results - page 16 / 35 » Search Complexities for HTN Planning |
ATAL
2009
Springer
14 years 2 months ago
2009
Springer
We introduce an adversarial planning algorithm based on game tree search, which is applicable in large-scale multiplayer domains. In order to tackle the scalability issues of game...
CADE
2005
Springer
14 years 7 months ago
2005
Springer
Proof planning is an automated reasoning technique which improves proof search by raising it to a meta-level. In this paper we apply proof planning to First-Order Linear Temporal L...
ECAI
2008
Springer
13 years 9 months ago
2008
Springer
At the "functional level", Semantic Web Services (SWS) are described akin to planning operators, with preconditions and effects relative to an ontology; the ontology prov...
CEC
2008
IEEE
14 years 2 months ago
2008
IEEE
— The problem of robotic area coverage is applicable to many domains, such as search, agriculture, cleaning, and machine tooling. The robotic area coverage task is concerned with...
SIGMOD
2009
ACM
14 years 7 months ago
2009
ACM
Most information extraction (IE) approaches have considered only static text corpora, over which we apply IE only once. Many real-world text corpora however are dynamic. They evol...