914 search results - page 69 / 183 » The Computational Complexity of Probabilistic Planning |
SIGMOD
2001
ACM
14 years 11 months ago
2001
ACM
Estimating the result size of complex queries that involve selection on multiple attributes and the join of several relations is a difficult but fundamental task in database query...
ECCC
2008
13 years 10 months ago
2008
While closed timelike curves (CTCs) are not known to exist, studying their consequences has led to nontrivial insights in general relativity, quantum information, and other areas....
ISB
2002
13 years 10 months ago
2002
Data Mining and Knowledge Discovery techniques proved to be efficient tools for variety of complex tasks in biology including DNA research. This paper presents implementation of th...
CCGRID
2004
IEEE
14 years 2 months ago
2004
IEEE
We conduct computer simulation experiments in pre-operative planning of vascular reconstruction with a physician in the experimental loop. We constructed a problem-solving environ...
FOCS
1998
IEEE
14 years 3 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...