17582 search results - page 3001 / 3517 » From Distributed Sequential Computing to Distributed Paralle... |
200
click to vote
MOBIHOC
2002
ACM
16 years 6 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
175
click to vote
SOSP
2009
ACM
16 years 3 months ago
2009
ACM
Commodity computer systems contain more and more processor cores and exhibit increasingly diverse architectural tradeoffs, including memory hierarchies, interconnects, instructio...
175
click to vote
SAC
2010
ACM
16 years 1 months ago
2010
ACM
Byzantine consensus in asynchronous message-passing systems has been shown to require at least 3f + 1 processes to be solvable in several system models (e.g., with failure detecto...
139
click to vote
COMPLEX
2009
Springer
16 years 1 months ago
2009
Springer
Financial fluctuations play a key role for financial markets studies. A new approach focusing on properties of return intervals can help to get better understanding of the fluct...
161
click to vote
ISAAC
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Set agreement is a fundamental problem in distributed computing in which processes collectively choose a small subset of values from a larger set of proposals. The imposs...