1389 search results - page 113 / 278 » Parallel Algorithms for Treewidth Two |
JDA
2008
14 years 10 months ago
2008
We show how to uniformly distribute data at random (not to be confounded with permutation routing) in two settings that are able to deal with massive data: coarse grained parallel...
PODC
2003
ACM
15 years 3 months ago
2003
ACM
We consider the model of unreliable network links, where at each time unit a link might be either up or down. We consider two related problems. The first, establishing end to end...
ICDCS
1996
IEEE
15 years 2 months ago
1996
IEEE
We propose a new algorithm for recovering asynchronously from failures in a distributed computation. Our algorithm is based on two novel concepts - a fault-tolerant vector clock t...
124
click to vote
PPSN
2010
Springer
14 years 7 months ago
2010
Springer
The all-pairs shortest path problem is the first non-artificial problem for which it was shown that adding crossover can significantly speed up a mutation-only evolutionary algorit...
SPAA
1996
ACM
15 years 2 months ago
1996
ACM
A quantitative comparison of the BSP and LogP models of parallel computation is developed. We concentrate on a variant of LogP that disallows the so-called stalling behavior, alth...