2613 search results - page 41 / 523 » On an Optimization Problem in Sensor Selection* |
CN
2010
13 years 7 months ago
2010
The dynamic point coverage problem in wireless sensor networks is to detect some moving target points in the area of the network using as little sensor nodes as possible. One way ...
SAGT
2010
Springer
13 years 6 months ago
2010
Springer
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
ICIP
2007
IEEE
14 years 9 months ago
2007
IEEE
We examine the trade-off between lifetime and distortion in image sensor networks deployed for gathering visual information over a monitored region. Users navigate over the monito...
INFOCOM
2007
IEEE
14 years 2 months ago
2007
IEEE
—We study the problem of landmark selection for landmark-based routing in a network of fixed wireless communication nodes. We present a distributed landmark selection algorithm ...
MOBISYS
2009
ACM
14 years 8 months ago
2009
ACM
Epilepsy affects over three million Americans of all ages. Despite recent advances, more than 20% of individuals with epilepsy never achieve adequate control of their seizures. Th...