661 search results - page 10 / 133 » On Distributed Computation in Noisy Random Planar Networks |
108
click to vote
VOSS
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. Randomization is of paramount importance in practical applications and randomized algorithms are used widely, for example in co-ordinating distributed computer networks, ...
118
click to vote
FCS
2009
14 years 11 months ago
2009
Circuits and loops in graph systems can be used to model the attractors in gene-regulatory networks. The number of such attractors grows very rapidly with network size and even fo...
160
click to vote
DIALM
2003
ACM
15 years 7 months ago
2003
ACM
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...
132
Voted
SBRN
2008
IEEE
15 years 8 months ago
2008
IEEE
The design of an autonomous navigation system for mobile robots can be a tough task. Noisy sensors, unstructured environments and unpredictability are among the problems which mus...
136
Voted
SENSYS
2006
ACM
15 years 7 months ago
2006
ACM
Geographic techniques promise highly scalable any-toany routing in wireless sensor networks. In one thread of research on geographic routing, researchers have explored robust, dis...