103 search results - page 20 / 21 » Online weighted flow time and deadline scheduling |
FOCS
1995
IEEE
14 years 4 days ago
1995
IEEE
Abstract. Littlestone developed a simple deterministic on-line learning algorithm for learning k-literal disjunctions. This algorithm (called Winnow) keeps one weight for each of t...
SOSP
2009
ACM
14 years 5 months ago
2009
ACM
This paper addresses the problem of scheduling concurrent jobs on clusters where application data is stored on the computing nodes. This setting, in which scheduling computations ...
ALGORITHMICA
2004
13 years 8 months ago
2004
We consider the problem of scheduling dynamically arriving jobs in a non-clairvoyant setting, that is, when the size of a job in remains unknown until the job finishes execution. ...
INFOCOM
2003
IEEE
14 years 1 months ago
2003
IEEE
— In this paper, we propose two schemes for the load balanced Birkhoff-von Neumann switches to provide guaranteed rate services. As in [7], the first scheme is based on an Earli...
ICDM
2008
IEEE
14 years 3 months ago
2008
IEEE
To cope with concept drift, we paired a stable online learner with a reactive one. A stable learner predicts based on all of its experience, whereas a reactive learner predicts ba...