Sciweavers

6437 search results - page 626 / 1288
» Parallel Algorithms for Arrangements
Sort
View
PPSN
1998
Springer
15 years 11 months ago
On Risky Methods for Local Selection under Noise
The choice of the selection method used in an evolutionary algorithm may have considerable impacts on the behavior of the entire algorithm. Therefore, earlier work was devoted to t...
Günter Rudolph
221
Voted
PODC
1997
ACM
15 years 11 months ago
Collecting Distributed Garbage Cycles by Back Tracing
Systems that store objects at a large number of sites require fault-tolerant and timely garbage collection. A popular technique is to trace each site independently using inter-sit...
Umesh Maheshwari, Barbara Liskov
190
Voted
ICDCS
1996
IEEE
15 years 11 months ago
How to Recover Efficiently and Asynchronously when Optimism Fails
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...
Om P. Damani, Vijay K. Garg
EUROPAR
1997
Springer
15 years 11 months ago
Sample Sort on Meshes
In this paper various algorithms for sorting on processor networks are considered. We focus on meshes, but the results can be generalized easily to other decomposable architecture...
Jop F. Sibeyn
178
Voted
IPPS
1994
IEEE
15 years 11 months ago
A Comparison of Heuristics for Scheduling DAGs on Multiprocessors
Many algorithms to schedule DAGs on multiprocessors have been proposed, but there has been little work done to determine their effectiveness. Since multi-processor scheduling is a...
Carolyn McCreary, A. A. Khan, J. J. Thompson, M. E...