1007 search results - page 116 / 202 » Worst-Case Optimal Algorithms for Parallel Query Processing |
133
Voted
ICDT
2005
ACM
15 years 8 months ago
2005
ACM
Abstract. A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an ion of this problem as a generalizati...
135
Voted
ALDT
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
114
Voted
CLUSTER
2001
IEEE
15 years 6 months ago
2001
IEEE
In this paper, we revisit the master-slave tasking paradigm in the context of heterogeneous processors. We assume that communications take place in exclusive mode. We present a po...
119
click to vote
COCO
2003
Springer
15 years 7 months ago
2003
Springer
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
119
Voted
IPPS
2010
IEEE
15 years 16 days ago
2010
IEEE
Abstract--A hybrid MPI/Pthreads parallelization was implemented in the RAxML phylogenetics code. New MPI code was added to the existing Pthreads production code to exploit parallel...