Sciweavers

184 search results - page 21 / 37
» Restricted Strip Covering and the Sensor Cover Problem
Sort
View
ICCCN
2008
IEEE
14 years 2 months ago
p-Percent Coverage Schedule in Wireless Sensor Networks
—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 ...
Shan Gao, Xiaoming Wang, Yingshu Li
ISAAC
2004
Springer
137views Algorithms» more  ISAAC 2004»
14 years 1 months ago
The Polymatroid Steiner Problems
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...
Gruia Calinescu, Alexander Zelikovsky
EOR
2006
61views more  EOR 2006»
13 years 7 months ago
Scheduling trainees at a hospital department using a branch-and-price approach
Scheduling trainees (graduate students) is a complicated problem that has to be solved frequently in many hospital departments. We will describe a trainee-scheduling problem encou...
Jeroen Beliën, Erik Demeulemeester
TCS
2008
13 years 7 months ago
Self-deployment of mobile sensors on a ring
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...
Paola Flocchini, Giuseppe Prencipe, Nicola Santoro
SSDBM
2009
IEEE
126views Database» more  SSDBM 2009»
14 years 2 months ago
Comprehensive Optimization of Declarative Sensor Network Queries
We present a novel sensor network query processing architecture that (a) covers all the query optimization phases that are required to map a declarative query to executable code; ...
Ixent Galpin, Christian Y. A. Brenninkmeijer, Farh...