6542 search results - page 289 / 1309 » The tao of parallelism in algorithms |
141
click to vote
COMPSAC
2005
IEEE
16 years 12 days ago
2005
IEEE
Parallel changes are a basic fact of modern software development. Where previously we looked at prima facie interference, here we investigate a less direct form that we call seman...
222
click to vote
PDCAT
2004
Springer
16 years 3 days ago
2004
Springer
Abstract. Agent-based simulation of large multicellular biological systems has become a viable option owing to affordable parallel computers, such as Beowulf-style clusters. We de...
165
click to vote
IPPS
1999
IEEE
15 years 11 months ago
1999
IEEE
We present a coarse grained parallel algorithm for computing a maximum matching in a convex bipartite graph G = A;B;E. For p processors with N=p memory per processor, N = jAj+jBj,...
178
Voted
STOC
1995
ACM
15 years 10 months ago
1995
ACM
We show that a parallel repetition of any two-prover one-round proof system (MIP(2, 1)) decreases the probability of error at an exponential rate. No constructive bound was previou...
160
click to vote
WSC
2007
15 years 9 months ago
2007
The Cross-Entropy (CE) method is a modern and effective optimization method well suited to parallel implementations. There is a vast array of problems today, some of which are hig...