Sciweavers

200 search results - page 8 / 40
» Minimizing Response Times in Real Time Planning and Search
Sort
View
VLDB
1994
ACM
153views Database» more  VLDB 1994»
13 years 11 months ago
Optimization Algorithms for Exploiting the Parallelism-Communication Tradeoff in Pipelined Parallelism
We address the problem of finding parallel plans for SQL queries using the two-phase approach of join ordering followed by parallelization. We focus on the parallelization phase a...
Waqar Hasan, Rajeev Motwani
DEXA
2010
Springer
213views Database» more  DEXA 2010»
13 years 8 months ago
Efficient K-Nearest Neighbor Search in Time-Dependent Spatial Networks
The class of k Nearest Neighbor (kNN) queries in spatial networks has been widely studied in the literature. All existing approaches for kNN search in spatial networks assume that ...
Ugur Demiryurek, Farnoush Banaei Kashani, Cyrus Sh...
ICDE
2008
IEEE
147views Database» more  ICDE 2008»
14 years 9 months ago
Flow Algorithms for Parallel Query Optimization
In this paper we address the problem of minimizing the response time of a multi-way join query using pipelined (inter-operator) parallelism, in a parallel or a distributed environ...
Amol Deshpande, Lisa Hellerstein
ICDE
2005
IEEE
107views Database» more  ICDE 2005»
14 years 1 months ago
The Quality vs. Time Trade-off for Approximate Image Descriptor Search
In recent years, content-based image retrieval has become more and more important in many application areas. Similarity retrieval is inherently a very demanding process, in partic...
Rut Siguroardottir, Björn Þór J&...
AIPS
2006
13 years 9 months ago
Combining Knowledge Compilation and Search for Conformant Probabilistic Planning
We present a new algorithm for conformant probabilistic planning, which for a given horizon produces a plan that maximizes the probability of success under quantified uncertainty ...
Jinbo Huang