Sciweavers

16404 search results - page 1 / 3281
» A set coverage problem
Sort
View
ISCC
2005
IEEE
146views Communications» more  ISCC 2005»
13 years 12 months ago
Preserving Area Coverage in Wireless Sensor Networks by Using Surface Coverage Relay Dominating Sets
— Sensor networks consist of autonomous nodes with limited battery and of base stations with theoritical infinite energy. Nodes can be sleep to extend the lifespan of the networ...
Jean Carle, Antoine Gallais, David Simplot-Ryl
IPL
2010
79views more  IPL 2010»
13 years 4 months ago
A set coverage problem
Guo-Qiang Zhang, Licong Cui
TASE
2010
IEEE
13 years 1 months ago
Coverage of a Planar Point Set With Multiple Robots Subject to Geometric Constraints
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
APPROX
2004
Springer
122views Algorithms» more  APPROX 2004»
13 years 11 months ago
Maximum Coverage Problem with Group Budget Constraints and Applications
We study a variant of the maximum coverage problem which we label the maximum coverage problem with group budget constraints (MCG). We are given a collection of sets S = {S1, S2, ....
Chandra Chekuri, Amit Kumar
CDC
2009
IEEE
168views Control Systems» more  CDC 2009»
13 years 11 months ago
Distributed coverage games for mobile visual sensors (II) : Reaching the set of global optima
— We formulate a coverage optimization problem for mobile visual sensor networks as a repeated multi-player game. Each visual sensor tries to optimize its own coverage while mini...
Minghui Zhu, Sonia Martínez