109 search results - page 4 / 22 » Faulty Random Geometric Networks |
IPPS
1998
IEEE
14 years 24 days ago
1998
IEEE
Abstract. Finding paths in high-dimensional gemetric spaces is a provably hard problem. Recently, a general randomized planning scheme has emerged as an e ective approach to solve ...
IM
2008
13 years 8 months ago
2008
Let G = G(n, r) be a random geometric graph resulting from placing n nodes uniformly at random in the unit square (disk) and connecting every two nodes if and only if their Euclide...
BIOINFORMATICS
2008
13 years 8 months ago
2008
Motivation: Finding a good network null model for protein-protein interaction (PPI) networks is a fundamental issue. Such a model would provide insights into the interplay between...
DIALM
2008
ACM
13 years 10 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 ...
INFORMATICALT
2006
13 years 8 months ago
2006
Generally, the task in a distributed system must achieve an agreement. It requires a set of processors to agree on a common value even if some components are corrupted. There are s...