620 search results - page 35 / 124 » The computational power of population protocols |
108
click to vote
CRYPTO
2007
Springer
15 years 4 months ago
2007
Springer
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
IANDC
2007
14 years 9 months ago
2007
ectly-synchronized round-based model provides the powerful abstraction of op failures with atomic and synchronous message delivery. This abstraction makes distributed programming ...
WCNC
2010
IEEE
15 years 1 months ago
2010
IEEE
—We study the problem of optimizing the symbol error probability (SEP) performance of cluster-based cooperative wireless sensor networks (WSNs). It is shown in the literature tha...
CSREASAM
2006
14 years 11 months ago
2006
Group communication is becoming increasingly popular in Internet applications such as videoconferences, online chatting programs, games, and gambling. For secure communications, th...
PDSE
1998
14 years 11 months ago
1998
With the advancement in network speed and computing power; distributed multimedia applications are becoming populal: However;generalprinciples of system testing cannot be directly...