348 search results - page 33 / 70 » Evaluating Temporal Planning Domains |
FLAIRS
2007
13 years 10 months ago
2007
Currently, among the fastest approaches to AI task planning we find many forward-chaining heuristic planners, as FF. Most of their good performance comes from the use of domain-i...
JAIR
2007
13 years 7 months ago
2007
We present a new algorithm for probabilistic planning with no observability. Our algorithm, called Probabilistic-FF, extends the heuristic forward-search machinery of Conformant-F...
AIPS
2006
13 years 9 months ago
2006
We present a new algorithm for probabilistic planning with no observability. Our algorithm, called Probabilistic-FF, extends the heuristic forward-search machinery of Conformant-F...
AAAI
1994
13 years 9 months ago
1994
This paper presents a plan-based architecture for response generation in collaborative consultation dialogues, with emphasis on cases in which the system (consultant) and user (ex...
ECAI
2010
Springer
13 years 5 months ago
2010
Springer
Many document collections are by nature dynamic, evolving as the topics or events they describe change. The goal of temporal text mining is to discover bursty patterns and to ident...