Sciweavers

370 search results - page 40 / 74
» Improved Approximation Algorithms for Connected Sensor Cover
Sort
View

Lecture Notes
443views
16 years 9 months ago
Design and Analysis of Computer Algorithms
"This course will consist of a number of major sections. The first will be a short review of some preliminary material, including asymptotics, summations, and recurrences and ...
David M. Mount
IPSN
2009
Springer
15 years 6 months ago
Simultaneous placement and scheduling of sensors
We consider the problem of monitoring spatial phenomena, such as road speeds on a highway, using wireless sensors with limited battery life. A central question is to decide where ...
Andreas Krause, Ram Rajagopal, Anupam Gupta, Carlo...
INFOCOM
2011
IEEE
14 years 3 months ago
Optimal multiple-coverage of sensor networks
—In wireless sensor networks, multiple-coverage, in which each point is covered by more than one sensor, is often required to improve detection quality and achieve high fault tol...
Xiaole Bai, Ziqiu Yun, Dong Xuan, Biao Chen, Wei Z...
ALGORITHMICA
2006
160views more  ALGORITHMICA 2006»
14 years 11 months ago
Combinatorial Algorithms for the Unsplittable Flow Problem
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
Yossi Azar, Oded Regev

Publication
334views
15 years 8 months ago
Rollout Sampling Approximate Policy Iteration
Several researchers have recently investigated the connection between reinforcement learning and classification. We are motivated by proposals of approximate policy iteration schem...
Christos Dimitrakakis, Michail G. Lagoudakis