2020 search results - page 29 / 404 » KDD Process Planning |
AIEDAM
1999
13 years 9 months ago
1999
EPIA
2001
Springer
14 years 2 months ago
2001
Springer
Dealing with temporality on actions presents an important challenge to AI planning. Unlike Graphplan-based planners which alternate levels of propositions and actions in a regular ...
ATAL
2008
Springer
13 years 11 months ago
2008
Springer
This paper addresses the problem of plan recognition for multiagent teams. Complex multi-agent tasks typically require dynamic teams where the team membership changes over time. T...
CORR
1998
Springer
13 years 9 months ago
1998
Springer
We examine the computational complexity of testing and nding small plans in probabilistic planning domains with both at and propositional representations. The complexity of plan e...
VLDB
2007
ACM
14 years 3 months ago
2007
ACM
Forecasting future events based on historic data is useful in many domains like system management, adaptive query processing, environmental monitoring, and financial planning. We...