914 search results - page 31 / 183 » The Computational Complexity of Probabilistic Planning |
AAAI
2000
13 years 11 months ago
2000
Recent work has demonstrated that treating resource reasoning separately from causal reasoning can lead to improved planning performance and rational resource management where inc...
COCO
2007
Springer
14 years 2 months ago
2007
Springer
We prove new results on the circuit complexity of Approximate Majority, which is the problem of computing Majority of a given bit string whose fraction of 1's is bounded away...
STOC
1993
ACM
14 years 2 months ago
1993
ACM
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
CVPR
2004
IEEE
15 years 11 days ago
2004
IEEE
Copyright 2004 IEEE. Published in Conference on Computer Vision and Pattern Recognition (CVPR-2004), June 27 - July 2, 2004, Washington DC. Personal use of this material is permit...
CSFW
2005
IEEE
14 years 4 months ago
2005
IEEE
We consider expansions of the Abadi-Rogaway logic of indistinguishability of formal cryptographic expressions. We expand the logic in order to cover cases when partial information...