75 search results - page 9 / 15 » Lower Bounds for Asynchronous Consensus |
WDAG
2007
Springer
14 years 2 months ago
2007
Springer
The timestamp problem captures a fundamental aspect of asynchronous distributed computing. It allows processes to label events throughout the system with timestamps that provide in...
CJ
2010
13 years 8 months ago
2010
A silent self-stabilizing asynchronous distributed algorithms is given for constructing a kdominating set, and hence a k-clustering, of a connected network of processes with uniqu...
WDAG
1992
Springer
14 years 4 days ago
1992
Springer
Abstract. The Choice Coordination Problem with k alternatives (kCCP) was introduced by Rabin in 1982 [Rab82]. The goal is to design a wait-free protocol for n asynchronous processe...
JACM
2002
13 years 7 months ago
2002
Abstract. Shared registers are basic objects used as communication mediums in asynchronous concurrent computation. A concurrent timestamp system is a higher typed communication obj...
ECML
2005
Springer
14 years 1 months ago
2005
Springer
We study estimation of mixture models for problems in which multiple views of the instances are available. Examples of this setting include clustering web pages or research papers ...