661 search results - page 52 / 133 » On Distributed Computation in Noisy Random Planar Networks |
102
click to vote
WDAG
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
103
click to vote
MOBIHOC
2012
ACM
13 years 7 days ago
2012
ACM
A key feature of wireless communications is the spatial reuse. However, the spatial aspect is not yet well understood for the purpose of designing efficient spectrum sharing mecha...
SPAA
1997
ACM
15 years 2 months ago
1997
ACM
Consider a set of shared objects in a distributed network, where several copies of each object may exist at any given time. To ensure both fast access to the objects as well as e ...
SAC
2008
ACM
14 years 9 months ago
2008
ACM
We present an analogy between the operation of a Wireless Sensor Network and the sampling and reconstruction of a signal. We measure the impact of three factors on the quality of ...
IPPS
2003
IEEE
15 years 3 months ago
2003
IEEE
In open multi-agent systems agents need resources provided by other agents but they are not aware of which agents provide the particular resources. Most solutions to this problem ...