7 search results - page 2 / 2 » dialm 2008 |
DIALM
2008
ACM
13 years 6 months ago
2008
ACM
A random geometric graph G(n, r) is a graph resulting from placing n points uniformly at random on the unit area disk, and connecting two points iff their Euclidean distance is at ...
DIALM
2010
ACM
13 years 2 months ago
2010
ACM
We present a method for using real world mobility traces to identify tractable theoretical models for the study of distributed algorithms in mobile networks. We validate the metho...