5606 search results - page 572 / 1122 » Randomization Techniques for Graphs. |
212
click to vote
WIOPT
2006
IEEE
16 years 1 months ago
2006
IEEE
— In this paper we investigate the limiting properties, in terms of capacity and delay, of an ad hoc network employing a topology-transparent scheduling scheme. In particular, we...
203
click to vote
TAMC
2010
Springer
16 years 6 days ago
2010
Springer
Abstract. In property testing, the goal is to distinguish between objects that satisfy some desirable property and objects that are far from satisfying it, after examining only a s...
226
click to vote
HICSS
2002
IEEE
16 years 3 days ago
2002
IEEE
Abstract. In this paper we describe several new clustering algorithms for nodes in a mobile ad hoc network. The main contribution is to generalize the cluster definition and forma...
194
click to vote
PODC
2009
ACM
15 years 12 months ago
2009
ACM
We present DRR-gossip, an energy-efficient and robust aggregate computation algorithm in wireless sensor networks. We prove that the DRR-gossip algorithm requires O(n) messages a...
230
click to vote
ISAAC
1999
Springer
15 years 11 months ago
1999
Springer
We consider online routing algorithms for routing between the vertices of embedded planar straight line graphs. Our results include (1) two deterministic memoryless routing algorit...