248 search results - page 25 / 50 » Geometrical Probability Covering Algorithm |
SODA
2007
ACM
13 years 8 months ago
2007
ACM
Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square o...
MST
2010
13 years 2 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
WSNA
2003
ACM
14 years 20 days ago
2003
ACM
One fundamental issue in sensor networks is the coverage problem, which reflects how well a sensor network is monitored or tracked by sensors. In this paper, we formulate this pr...
ISSTA
2004
ACM
14 years 25 days ago
2004
ACM
This paper deals with testing of nondeterministic software systems. We assume that a model of the nondeterministic system is given by a directed graph with two kind of vertices: s...
GECCO
2005
Springer
14 years 28 days ago
2005
Springer
We study if and when the inequality dp(H) ≤ rel∆(H) holds for schemas H in chromosomes that are structured as trees. The disruption probability dp(H) is the probability that a...