661 search results - page 10 / 133 » On Distributed Computation in Noisy Random Planar Networks |
VOSS
2004
Springer
15 years 3 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, ...
FCS
2009
14 years 7 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...
113
click to vote
DIALM
2003
ACM
15 years 2 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...
SBRN
2008
IEEE
15 years 4 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...
100
click to vote
SENSYS
2006
ACM
15 years 3 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...