Sciweavers

1008 search results - page 5 / 202
» Minimizing Average Flow-Time
Sort
View
ORL
2006
116views more  ORL 2006»
13 years 7 months ago
Greedy multiprocessor server scheduling
We show that the greedy Highest Density First (HDF) algorithm is (1+ )-speed O(1)-competitive for the problem of minimizing the p norms of weighted flow time on m identical machin...
Carl Bussema, Eric Torng
SIGMETRICS
2010
ACM
115views Hardware» more  SIGMETRICS 2010»
13 years 2 months ago
The average response time in a heavy-traffic srpt queue
Shortest Remaining Processing Time first (SRPT) has long been known to optimize the queue length distribution and the mean response time (a.k.a. flow time, sojourn time). As such,...
Minghong Lin, Adam Wierman, Bert Zwart
CORR
2006
Springer
112views Education» more  CORR 2006»
13 years 7 months ago
Pull-Based Data Broadcast with Dependencies: Be Fair to Users, not to Items
Broadcasting is known to be an efficient means of disseminating data in wireless communication environments (such as Satellite, mobile phone networks,...). It has been recently ob...
Julien Robert, Nicolas Schabanel
COLT
2010
Springer
13 years 5 months ago
Regret Minimization With Concept Drift
In standard online learning, the goal of the learner is to maintain an average loss that is "not too big" compared to the loss of the best-performing function in a fixed...
Koby Crammer, Yishay Mansour, Eyal Even-Dar, Jenni...
QEST
2010
IEEE
13 years 5 months ago
Symblicit Calculation of Long-Run Averages for Concurrent Probabilistic Systems
Abstract--Model checkers for concurrent probabilistic systems have become very popular within the last decade. The study of long-run average behavior has however received only scan...
Ralf Wimmer, Bettina Braitling, Bernd Becker, Erns...