Sciweavers

914 search results - page 59 / 183
» The Computational Complexity of Probabilistic Planning
Sort
View
COCO
2000
Springer
112views Algorithms» more  COCO 2000»
14 years 3 months ago
Combinatorial Interpretation of Kolmogorov Complexity
Kolmogorov’s very first paper on algorithmic information theory (Kolmogorov, Problemy peredachi infotmatsii 1(1) (1965), 3) was entitled “Three approaches to the definition ...
Andrei E. Romashchenko, Alexander Shen, Nikolai K....
ICALP
2005
Springer
14 years 4 months ago
Probabilistic Polynomial-Time Semantics for a Protocol Security Logic
Abstract. We describe a cryptographically sound formal logic for proving protocol security properties without explicitly reasoning about probability, asymptotic complexity, or the ...
Anupam Datta, Ante Derek, John C. Mitchell, Vitaly...
FMCO
2004
Springer
112views Formal Methods» more  FMCO 2004»
14 years 4 months ago
Probabilistic Linda-Based Coordination Languages
Abstract. Coordination languages are intended to simplify the development of complex software systems by separating the coordination aspects of an application from its computation ...
Alessandra Di Pierro, Chris Hankin, Herbert Wiklic...
ICRA
2010
IEEE
69views Robotics» more  ICRA 2010»
13 years 9 months ago
Probabilistic shadow information spaces
— 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...
Jingjin Yu, Steven M. LaValle
ICRA
2008
IEEE
157views Robotics» more  ICRA 2008»
14 years 5 months ago
Impact of workspace decompositions on discrete search leading continuous exploration (DSLX) motion planning
Abstract— We have recently proposed DSLX, a motion planner that significantly reduces the computational time for solving challenging kinodynamic problems by interleaving continu...
Erion Plaku, Lydia E. Kavraki, Moshe Y. Vardi