914 search results - page 24 / 183 » The Computational Complexity of Probabilistic Planning |
ICANN
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. We investigate the computational capabilities of probabilistic cellular automata by means of the density classification problem. We find that a specific probabilistic ...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
Strong and weak simulation relations have been proposed for Markov chains, while strong simulation and strong probabilistic simulation relations have been proposed for probabilisti...
FOCS
1998
IEEE
14 years 2 months ago
1998
IEEE
We present a higher-order functional notation for polynomial-time computation with arbitrary 0; 1-valued oracle. This provides a linguistic characterization for classes such as np...
HRI
2006
ACM
14 years 4 months ago
2006
ACM
Autonomous robots use sensors to perceive and track objects in the world. Tracking algorithms use object motion models to estimate the position of a moving object. Tracking effic...
ACSC
2009
IEEE
14 years 5 months ago
2009
IEEE
Hierarchical Task Networks (HTNs) are a family of powerful planning algorithms that have been successfully applied to many complex, real-world domains. However, they are limited t...