2814 search results - page 260 / 563 » Competitive Analysis of Distributed Algorithms |
109
click to vote
SSS
2010
Springer
14 years 10 months ago
2010
Springer
Design and implementation of distributed algorithms often involve many subtleties due to their complex structure, non-determinism, and low atomicity as well as occurrence of unanti...
116
Voted
PPAM
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorit...
118
Voted
STOC
2003
ACM
15 years 5 months ago
2003
ACM
We introduce the use of Fourier analysis on lattices as an integral part of a lattice based construction. The tools we develop provide an elegant description of certain Gaussian d...
119
click to vote
ISPAN
1996
IEEE
15 years 4 months ago
1996
IEEE
In this paper, we study a synchronous execution strategy f o r parallel join computation in multiprocessor systems. Through a further comprehensive investigation of the processor ...
137
click to vote
COCO
2009
Springer
15 years 7 months ago
2009
Springer
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...