Sciweavers

867 search results - page 5 / 174
» The Generalized Maximum Coverage Problem
Sort
View
ICC
2007
IEEE
123views Communications» more  ICC 2007»
14 years 2 months ago
Redundant Coverage in Wireless Sensor Networks
Abstract— Coverage is a fundamental problem in sensor networks. In this paper, we addressed the coverage problem from two different view points and refer to them as the worst and...
Can Fang, Chor Ping Low
TWC
2008
193views more  TWC 2008»
13 years 7 months ago
Coverage for target localization in wireless sensor networks
Target tracking and localization are important applications in wireless sensor networks. Although the coverage problem for target detection has been intensively studied, few consi...
Wei Wang 0002, Vikram Srinivasan, Bang Wang, Kee C...
WSNA
2003
ACM
14 years 1 months ago
The coverage problem in a wireless sensor network
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...
Chi-Fu Huang, Yu-Chee Tseng
COCOON
2004
Springer
13 years 11 months ago
k-Center Problems with Minimum Coverage
In this work, we study an extension of the k-center facility location problem, where centers are required to service a minimum of clients. This problem is motivated by requirement...
Andrew Lim, Brian Rodrigues, Fan Wang, Zhou Xu
AAIM
2007
Springer
116views Algorithms» more  AAIM 2007»
14 years 1 months ago
Solving Generalized Maximum Dispersion with Linear Programming
The Generalized Maximum Dispersion problem asks for a partition of a given graph into p vertex-disjoint sets, each of them having at most k vertices. The goal is to maximize the to...
Gerold Jäger, Anand Srivastav, Katja Wolf