156 search results - page 20 / 32 » Decomposing Coverings and the Planar Sensor Cover Problem |
INFOCOM
2003
IEEE
14 years 26 days ago
2003
IEEE
— We propose a new framework for providing robust location detection in emergency response systems, based on the theory of identifying codes. The key idea of this approach is to ...
ICCCN
2008
IEEE
14 years 2 months ago
2008
IEEE
—We investigate the p-percent coverage problem in this paper and propose two algorithms to prolong network lifetime based on the fact that for some applications full coverage is ...
ISAAC
2004
Springer
14 years 29 days ago
2004
Springer
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
ICRA
2006
IEEE
14 years 1 months ago
2006
IEEE
– In this paper, we proposed an improved algorithm for the multi-robot complete coverage problem. Real world applications such as lawn mowing, chemical spill clean-up, and humani...
TCS
2008
13 years 7 months ago
2008
Mobile sensors can self-deploy in a purely decentralized and distributed fashion, so to reach in finite time a state of static equilibrium in which they cover uniformly the enviro...