Sciweavers

955 search results - page 24 / 191
» Cover Set Problem in Directional Sensor Networks
Sort
View
ECML
2006
Springer
15 years 1 months ago
The Minimum Volume Covering Ellipsoid Estimation in Kernel-Defined Feature Spaces
Minimum volume covering ellipsoid estimation is important in areas such as systems identification, control, video tracking, sensor management, and novelty detection. It is well kno...
Alexander N. Dolia, Tijl De Bie, Christopher J. Ha...
WG
2007
Springer
15 years 3 months ago
Minimum-Weight Cycle Covers and Their Approximability
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
Bodo Manthey
CDC
2009
IEEE
168views Control Systems» more  CDC 2009»
15 years 2 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
CDC
2009
IEEE
178views Control Systems» more  CDC 2009»
15 years 2 months ago
Distributed coverage games for mobile visual sensors (I): Reaching the set of Nash equilibria
— 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
ALGOSENSORS
2006
Springer
15 years 1 months ago
Self-deployment Algorithms for Mobile Sensors on a Ring
Abstract. We consider the self-deployment problem in a ring for a network of identical sensors: starting from some initial random placement in the ring, the sensors in the network ...
Paola Flocchini, Giuseppe Prencipe, Nicola Santoro