407 search results - page 2 / 82 » The Optimal Online Algorithms for Minimizing Maximum Latenes... |
MST
2008
13 years 5 months ago
2008
We study the problem of on-line scheduling on two uniformly related machines where the on-line algorithm has resources different from those of the off-line algorithm. We consider ...
SPAA
2005
ACM
13 years 10 months ago
2005
ACM
We study the admission control problem in general networks. Communication requests arrive over time, and the online algorithm accepts or rejects each request while maintaining the...
WAOA
2005
Springer
13 years 10 months ago
2005
Springer
INFOCOM
2007
IEEE
13 years 11 months ago
2007
IEEE
— This paper presents an algorithm for maximizing the lifetime of a sensor network while guaranteeing an upper bound on the end-to-end delay. We prove that the proposed algorithm...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
In this paper two scheduling models are addressed. First is the standard model (unicast) where requests (or jobs) are independent. The other is the broadcast model where broadcast...