206 search results - page 19 / 42 » Better Bounds for Online Scheduling |
COMPGEOM
1992
ACM
14 years 26 days ago
1992
ACM
Suppose we are given a sequence of n points in the Euclidean plane, and our objective is to construct, on-line, a connected graph that connects all of them, trying to minimize the...
PC
2008
13 years 8 months ago
2008
In this paper, we assess the impact of heterogeneity on scheduling independent tasks on master-slave platforms. We assume a realistic one-port model where the master can communica...
CSCW
1998
ACM
14 years 1 months ago
1998
ACM
we have documented shares some of the influences discussed by Ackerman et. al., but has unique dynamics of its own which present unique technical and social demands. Using several ...
ESA
2009
Springer
14 years 3 months ago
2009
Springer
We consider online algorithms for pull-based broadcast scheduling. In this setting there are n pages of information at a server and requests for pages arrive online. When the serv...
SIAMDM
2002
13 years 8 months ago
2002
We present a new class of randomized approximation algorithms for unrelated parallel machine scheduling problems with the average weighted completion time objective. The key idea i...