1074 search results - page 27 / 215 » An ASM-Characterization of a Class of Distributed Algorithms |
108
click to vote
PODC
2000
ACM
15 years 2 months ago
2000
ACM
Distributed programs are hard to write. A distributed debugger equipped with the mechanism to re-execute the traced computation in a controlled fashion can greatly facilitate the ...
74
Voted
PPSN
2004
Springer
15 years 3 months ago
2004
Springer
Current Genetic Algorithms can efficiently address order-k separable problems, in which the order of the linkage is restricted to a low value k. Outside this class, there exist hie...
73
Voted
IPPS
2007
IEEE
15 years 4 months ago
2007
IEEE
The design of algorithms that can run unchanged yet efficiently on a variety of machines characterized by different degrees of parallelism and communication capabilities is a hig...
ACTA
2007
14 years 9 months ago
2007
We provide a novel model to formalize a well-known algorithm, by Chandra and Toueg, that solves Consensus among asynchronous distributed processes in the presence of a particular ...
71
Voted
NIPS
2007
14 years 11 months ago
2007
We present a simple, agnostic active learning algorithm that works for any hypothesis class of bounded VC dimension, and any data distribution. Our algorithm extends a scheme of C...