Sciweavers

2354 search results - page 165 / 471
» Assignment Problems
Sort
View
ALGOSENSORS
2010
Springer
15 years 4 months ago
Lifetime Maximization of Monitoring Sensor Networks
We study the problem of maximizing the lifetime of a sensor network assigned to monitor a given area. Our main result is a linear time dual approximation algorithm that comes arbit...
Peter Sanders, Dennis Schieferdecker
WAOA
2005
Springer
84views Algorithms» more  WAOA 2005»
15 years 10 months ago
A Note on Semi-online Machine Covering
In the machine cover problem we are given m machines and n jobs to be assigned (scheduled) so that the smallest load of a machine is as large as possible. A semi-online algorithm i...
Tomás Ebenlendr, John Noga, Jiri Sgall, Ger...
143
Voted
ATAL
2010
Springer
15 years 6 months ago
A decentralised coordination algorithm for minimising conflict and maximising coverage in sensor networks
In large wireless sensor networks, the problem of assigning radio frequencies to sensing agents such that no two connected sensors are assigned the same value (and will thus inter...
Ruben Stranders, Alex Rogers, Nicholas R. Jennings
STOC
1990
ACM
108views Algorithms» more  STOC 1990»
15 years 9 months ago
Optimal Randomized Algorithms for Local Sorting and Set-Maxima
We present randomized algorithms for two sorting problems. In the local sorting problem, a graph is given in which each vertex is assigned an element of a total order, and the task...
Wayne Goddard, Valerie King, Leonard J. Schulman
TMM
2010
151views Management» more  TMM 2010»
14 years 11 months ago
SPANC: Optimizing Scheduling Delay for Peer-to-Peer Live Streaming
Abstract--In peer-to-peer (P2P) live streaming using unstructured mesh, packet scheduling is an important factor in overall playback delay. In this paper, we propose a scheduling a...
Tammy Kam-Hung Chan, Shueng-Han Gary Chan, Ali C. ...