Sciweavers

29 search results - page 4 / 6
» swat 2004
Sort
View
SWAT
2004
Springer
129views Algorithms» more  SWAT 2004»
15 years 11 months ago
Online Scheduling of Splittable Tasks in Peer-to-Peer Networks
We consider online scheduling of splittable tasks on parallel machines. In our model, each task can be split into a limited number of parts, that can then be scheduled independentl...
Leah Epstein, Rob van Stee
SWAT
2004
Springer
109views Algorithms» more  SWAT 2004»
15 years 11 months ago
Robust Subgraphs for Trees and Paths
Consider a graph problem which is associated with a parameter, for example, that of finding a longest tour spanning k vertices. The following question is natural: Is there a smal...
Refael Hassin, Danny Segev
SWAT
2004
Springer
142views Algorithms» more  SWAT 2004»
15 years 11 months ago
Getting the Best Response for Your Erg
We consider the speed scaling problem of minimizing the average response time of a collection of dynamically released jobs subject to a constraint A on energy used. We propose an ...
Kirk Pruhs, Patchrawat Uthaisombut, Gerhard J. Woe...
SWAT
2004
Springer
138views Algorithms» more  SWAT 2004»
15 years 11 months ago
Faster Deterministic Gossiping in Directed Ad Hoc Radio Networks
Abstract. We study the gossiping problem in directed ad-hoc radio networks. Our main result is a deterministic algorithm that solves this problem in an n-node network in time O(n4/...
Leszek Gasieniec, Tomasz Radzik, Qin Xin
SWAT
2004
Springer
120views Algorithms» more  SWAT 2004»
15 years 11 months ago
Railway Delay Management: Exploring Its Algorithmic Complexity
We consider delay management in railway systems. Given delayed trains, we want to find a waiting policy for the connecting trains minimizing the weighted total passenger delay. If...
Michael Gatto, Björn Glaus, Riko Jacob, Leon ...