Sciweavers

184 search results - page 2 / 37
» Restricted Strip Covering and the Sensor Cover Problem
Sort
View
IPCO
2010
160views Optimization» more  IPCO 2010»
13 years 6 months ago
On Column-Restricted and Priority Covering Integer Programs
In a column-restricted covering integer program (CCIP), all the non-zero entries of any column of the constraint matrix are equal. Such programs capture capacitated versions of cov...
Deeparnab Chakrabarty, Elyot Grant, Jochen Kö...
FGCN
2007
IEEE
149views Communications» more  FGCN 2007»
13 years 11 months ago
Cover Set Problem in Directional Sensor Networks
— A directional sensor network consists of a number of directional sensors, which can switch to several directions to extend their sensing ability to cover the interested targets...
Yanli Cai, Wei Lou, Minglu Li
DCOSS
2005
Springer
13 years 10 months ago
A Distributed Greedy Algorithm for Connected Sensor Cover in Dense Sensor Networks
Abstract. Achieving optimal battery usage and prolonged network lifetime are two of the most fundamental issues in wireless sensor networks. By exploiting node and data redundancy ...
Amitabha Ghosh, Sajal K. Das
HICSS
2008
IEEE
153views Biometrics» more  HICSS 2008»
13 years 5 months ago
Fault-Tolerant k-Fold Pivot Routing in Wireless Sensor Networks
Selecting a small set of nodes called pivots, from all the nodes in a network and maintaining the routing infrastructure to and among each other can reduce routing overhead and ex...
Doina Bein
4OR
2008
115views more  4OR 2008»
13 years 3 months ago
A branch-and-price algorithm for the two-dimensional level strip packing problem
The two-dimensional level strip packing problem (2LSPP) consists in packing rectangular items of given size into a strip of given width divided into levels. Items packed into the ...
Andrea Bettinelli, Alberto Ceselli, Giovanni Righi...