60 search results - page 1 / 12 » k-Center Problems with Minimum Coverage |
COCOON
2004
Springer
13 years 8 months ago
2004
Springer
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...
CONEXT
2008
ACM
13 years 5 months ago
2008
ACM
One of the fundamental problems in the wireless sensor networks is the coverage problem. The coverage problem fundamentally address the quality of service (surveillance or monitor...
ICRA
2008
IEEE
13 years 11 months ago
2008
IEEE
— This paper focuses on the assignment of discrete points to two robots, in the presence of geometric and kinematic constraints between the robots. The individual points have dif...
TASE
2010
IEEE
12 years 11 months ago
2010
IEEE
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...
GLOBECOM
2007
IEEE
13 years 11 months ago
2007
IEEE
—Network lifetime is a critical issue in Wireless Sensor Networks. It is possible to extend network lifetime by organizing the sensors into a number of sensor covers. However, wi...