284 search results - page 11 / 57 » Distributed Agreement with Optimal Communication Complexity |
106
click to vote
IJCAI
2003
15 years 1 months ago
2003
Teamwork demands agreement among teammembers to collaborate and coordinate effectively. When a disagreement between teammates occurs (due to failures), team-members should ideally...
TRIDENTCOM
2006
IEEE
15 years 5 months ago
2006
IEEE
– This paper presents a reliable decentralized mutual exclusion algorithm for distributed systems in which processes communicate by asynchronous message passing. When any failure...
93
Voted
ICPP
2009
IEEE
15 years 6 months ago
2009
IEEE
—The implementation and optimization of collective communication operations is an important field of active research. Such operations directly influence application performance...
JAIR
2008
14 years 11 months ago
2008
Multi-agent planning in stochastic environments can be framed formally as a decentralized Markov decision problem. Many real-life distributed problems that arise in manufacturing,...
146
Voted
PODC
2011
ACM
14 years 2 months ago
2011
ACM
We study the time-complexity of robust atomic read/write storage from fault-prone storage components in asynchronous message-passing systems. Robustness here means wait-free tolera...