914 search results - page 106 / 183 » The Computational Complexity of Probabilistic Planning |
108
click to vote
HRI
2007
ACM
15 years 3 months ago
2007
ACM
Intelligent planning algorithms such as the Partially Observable Markov Decision Process (POMDP) have succeeded in dialog management applications [10, 11, 12] because of their rob...
104
click to vote
PROCEDIA
2010
14 years 10 months ago
2010
Large-scale distributed applications are becoming more and more demanding in terms of efficiency and flexibility of the technological infrastructure, for which traditional soluti...
SIGGRAPH
2010
ACM
15 years 4 months ago
2010
ACM
We describe a framework for the automatic synthesis of biped locomotion controllers that adapt to uneven terrain at run-time. The framework consists of two components: a per-foots...
HPCN
1995
Springer
15 years 3 months ago
1995
Springer
In the global economy, proper organisation and planning of production and storage locations, transportation and scheduling are vital to retain the competitive edge of companies. Th...
113
click to vote
CVPR
2003
IEEE
16 years 1 months ago
2003
IEEE
The likelihood models used in probabilistic visual tracking applications are often complex non-linear and/or nonGaussian functions, leading to analytically intractable inference. ...