914 search results - page 23 / 183 » The Computational Complexity of Probabilistic Planning |
AIPS
2004
13 years 9 months ago
2004
Resource envelopes provide the tightest exact bounds on the resource consumption and production caused by all possible executions of a temporally flexible plan. We present a new c...
ICCV
2007
IEEE
14 years 9 months ago
2007
IEEE
We propose a simple probabilistic generative model for image segmentation. Like other probabilistic algorithms (such as EM on a Mixture of Gaussians) the proposed model is princip...
RECOMB
2004
Springer
14 years 8 months ago
2004
Springer
We propose a novel, motion planning based approach to approximately map the energy landscape of an RNA molecule. Our method is based on the successful probabilistic roadmap motion...
AIPS
2009
13 years 8 months ago
2009
It has long been recognized that users can have complex preferences on plans. Non-intrusive learning of such preferences by observing the plans executed by the user is an attracti...
FOCS
1991
IEEE
13 years 11 months ago
1991
IEEE
We prove that the reliable computation of any Boolean function with sensitivity s requires Ω(s log s) gates if the gates of the circuit fail independently with a fixed positive...