914 search results - page 59 / 183 » The Computational Complexity of Probabilistic Planning |
COCO
2000
Springer
14 years 3 months ago
2000
Springer
Kolmogorov’s very first paper on algorithmic information theory (Kolmogorov, Problemy peredachi infotmatsii 1(1) (1965), 3) was entitled “Three approaches to the definition ...
ICALP
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. We describe a cryptographically sound formal logic for proving protocol security properties without explicitly reasoning about probability, asymptotic complexity, or the ...
FMCO
2004
Springer
14 years 4 months ago
2004
Springer
Abstract. Coordination languages are intended to simplify the development of complex software systems by separating the coordination aspects of an application from its computation ...
ICRA
2010
IEEE
13 years 9 months ago
2010
IEEE
— This paper introduces a Bayesian filter that is specifically designed for counting targets that move outside of the field of view while performing a sensor sweep. Informatio...
ICRA
2008
IEEE
14 years 5 months ago
2008
IEEE
Abstract— We have recently proposed DSLX, a motion planner that significantly reduces the computational time for solving challenging kinodynamic problems by interleaving continu...