520 search results - page 17 / 104 » New Complexity Results for Classical Planning Benchmarks |
ICRA
2007
IEEE
14 years 1 months ago
2007
IEEE
— The success of sampling-based motion planners has resulted in a plethora of methods for improving planning components, such as sampling and connection strategies, local planner...
AIPS
2007
13 years 9 months ago
2007
We consider the problem of finding an n-agent jointpolicy for the optimal finite-horizon control of a decentralized Pomdp (Dec-Pomdp). This is a problem of very high complexity ...
DEBS
2008
ACM
13 years 9 months ago
2008
ACM
Several new Complex Event Processing (CEP) engines have been recently released, many of which are intended to be used in performance sensitive scenarios - like fraud detection, tr...
IJCAI
2003
13 years 8 months ago
2003
Relaxed plans are used in the heuristic search planner FF for computing a numerical heuristic and extracting helpful actions. We present a novel way for extracting information fro...
COLT
2010
Springer
13 years 5 months ago
2010
Springer
We define a new model of quantum learning that we call Predictive Quantum (PQ). This is a quantum analogue of PAC, where during the testing phase the student is only required to a...