470 search results - page 63 / 94 » Local properties of geometric graphs |
111
click to vote
ICDCS
2002
IEEE
15 years 4 months ago
2002
IEEE
The need for sharing is well known in a large number of distributed collaborative applications. These applications are difficult to develop for wide area (possibly mobile) networ...
103
click to vote
INFOCOM
2008
IEEE
15 years 6 months ago
2008
IEEE
In this paper, we characterize the performance of an important class of scheduling schemes, called Greedy Maximal Scheduling (GMS), for multi-hop wireless networks. While a lower ...
GLOBECOM
2007
IEEE
15 years 6 months ago
2007
IEEE
—To understand how node mobility and Byzantine node failures affect connectivity of wireless multi-hop networks, this paper investigates resilience of geometric random graphs to ...
CORR
2010
Springer
14 years 12 months ago
2010
Springer
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
CDC
2009
IEEE
15 years 4 months ago
2009
IEEE
— Rigidity of formation is an importance concept in multi-agent localization and control problems. There are welldeveloped existing methods to test the rigidity of a given graph....