28 search results - page 5 / 6 » Complexity of Probabilistic Planning under Average Rewards |
ICRA
2002
IEEE
13 years 9 months ago
2002
IEEE
:This paper presents a trajectory planning algorithm for mobile robots which may be subject to kinodynamic constraints. Using computational methods from noncommutative harmonic ana...
COGSCI
2010
13 years 5 months ago
2010
Words are the essence of communication: they are the building blocks of any language. Learning the meaning of words is thus one of the most important aspects of language acquisiti...
AIPS
2008
13 years 7 months ago
2008
The POMDP is considered as a powerful model for planning under uncertainty. However, it is usually impractical to employ a POMDP with exact parameters to model precisely the real-...
UAI
2003
13 years 6 months ago
2003
Many practitioners who use EM and related algorithms complain that they are sometimes slow. When does this happen, and what can be done about it? In this paper, we study the gener...
DNA
2011
Springer
12 years 4 months ago
2011
Springer
Several molecular systems form large-scale objects. One would like to understand their assembly and how this assembly is regulated. As a first step, we investigate the phase trans...