160 search results - page 31 / 32 » Planning Graph Heuristics for Belief Space Search |
EDBT
2004
ACM
14 years 5 months ago
2004
ACM
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...
IUI
2003
ACM
13 years 11 months ago
2003
ACM
How do we know if we can afford a particular purchase? We can find out what the payments might be and check our balances on various accounts, but does this answer the question? Wh...
VLDB
1990
ACM
13 years 9 months ago
1990
ACM
Even though the large body of knowledge of relational query optimization techniques can be utilized as a starting point for object-oriented query optimization the full exploitatio...
CP
2007
Springer
13 years 12 months ago
2007
Springer
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...
CIKM
2009
Springer
14 years 10 days ago
2009
Springer
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...