1434 search results - page 50 / 287 » Distributed Computing with Imperfect Randomness |
SPAA
2010
ACM
13 years 7 months ago
2010
ACM
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
ATAL
2011
Springer
12 years 7 months ago
2011
Springer
We develop an algorithm for opponent modeling in large extensive-form games of imperfect information. It works by observing the opponent’s action frequencies and building an opp...
CVPR
2009
IEEE
14 years 12 months ago
2009
IEEE
Central to many problems in scene understanding based on using a network of tens, hundreds or even thousands of randomly distributed cameras with on-board processing and wireless c...
ICPP
2003
IEEE
14 years 27 days ago
2003
IEEE
In this paper, we propose a priority-based balanced routing scheme, called the priority STAR routing scheme, which leads to optimal throughput and average delay at the same time f...
ICDCS
2007
IEEE
14 years 1 months ago
2007
IEEE
Both peer-to-peer and sensor networks have the fundamental characteristics of node churn and failures. Peers in P2P networks are highly dynamic, whereas sensors are not dependable...