661 search results - page 26 / 133 » On Distributed Computation in Noisy Random Planar Networks |
ICPP
2002
IEEE
15 years 2 months ago
2002
IEEE
In this paper, we formulate the array robustness theorems (ARTs) for efficient computation and communication on faulty arrays. No hardware redundancy is required and no assumptio...
DSN
2006
IEEE
15 years 3 months ago
2006
IEEE
Randomized agreement protocols have been around for more than two decades. Often assumed to be inefficient due to their high expected communication and time complexities, they ha...
NOSSDAV
2009
Springer
15 years 4 months ago
2009
Springer
Peer-to-peer distributed virtual environments (DVE's) distribute state tracking and state transitions. Many DVE's - such as online games - require ways to fairly determi...
217
Voted
Lecture Notes
Comparing systems using measurement, simulation, and queueing models. Common mistakes and how to avoid them, selection of techniques and metrics, art of data presentation, summariz...
MOBIHOC
2001
ACM
15 years 9 months ago
2001
ACM
We propose a new routing graph, the Restricted Delaunay Graph (RDG), for ad hoc networks. Combined with a node clustering algorithm, RDG can be used as an underlying graph for geo...