914 search results - page 29 / 183 » The Computational Complexity of Probabilistic Planning |
MLG
2007
Springer
14 years 4 months ago
2007
Springer
Recent investigations [12, 2, 8, 5, 6] and [11, 9] indicate the use of a probabilistic (’learning’) perspective of tasks defined on a single graph, as opposed to the traditio...
COMPULOG
1999
Springer
14 years 2 months ago
1999
Springer
Planning and scheduling attracts an unceasing attention of computer science community. However, despite of similar character of both tasks, in most current systems planning and sch...
ACMSE
2006
ACM
14 years 2 months ago
2006
ACM
In this paper, we offer an exposition of a theorem originally due to Adleman, Demarrais and Huang that shows that the quantum complexity class BQP (Bounded-error Quantum Polynomia...
EDBT
2006
ACM
14 years 10 months ago
2006
ACM
In this paper we present a novel approach for estimating the selectivity of XML twig queries. Such a technique is useful for approximate query answering as well as for determining...
ATAL
2003
Springer
14 years 3 months ago
2003
Springer
A team of agents planning to perform a complex task make a number of interrelated decisions as they determine precisely how that complex task will be performed. The decision set i...