1542 search results - page 258 / 309 » The metamathematics of random graphs |
TAMC
2010
Springer
14 years 1 months 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...
HICSS
2002
IEEE
14 years 1 months 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...
PODC
2009
ACM
14 years 1 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...
ISAAC
1999
Springer
14 years 29 days 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...
ESA
2006
Springer
14 years 10 days ago
2006
Springer
Abstract. We consider the problem of finding shortest paths in a graph with independent randomly distributed edge lengths. Our goal is to maximize the probability that the path len...