620 search results - page 63 / 124 » The computational power of population protocols |
STOC
2006
ACM
15 years 10 months ago
2006
ACM
We present a randomized Byzantine Agreement (BA) protocol with an expected running time of O(log n) rounds, in a synchronous full-information network of n players. For any constan...
PODC
2010
ACM
15 years 1 months ago
2010
ACM
This paper introduces the distributed MAC protocol Jade. We consider a multi-hop wireless network with a single communication channel in which a powerful adversary is able to jam ...
109
click to vote
APSEC
2001
IEEE
15 years 1 months ago
2001
IEEE
Word processing software, email, and spreadsheet have revolutionized office activities. There are many other office tasks that are amenable to automation, such as: scheduling a vi...
PODC
2009
ACM
15 years 10 months ago
2009
ACM
Consider a completely asynchronous network consisting of n parties where every two parties are connected by a private channel. An adversary At with unbounded computing power activ...
ESCIENCE
2005
IEEE
15 years 3 months ago
2005
IEEE
This paper describes our experience with SegHidro, a project that empowers hydro-meteorological researchers by (i) enabling collaborative work via the coupling of computer models,...