103 search results - page 8 / 21 » On the Competitive Ratio of the Work Function Algorithm for ... |
ESA
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We study online scheduling to minimize flow time plus energy usage in the dynamic speed scaling model. We devise new speed scaling functions that depend on the number of ...
STOC
2007
ACM
14 years 7 months ago
2007
ACM
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
SIGECOM
2004
ACM
14 years 29 days ago
2004
ACM
For the problem of online real-time scheduling of jobs on a single processor, previous work presents matching upper and lower bounds on the competitive ratio that can be achieved ...
ICIP
2007
IEEE
14 years 1 months ago
2007
IEEE
Palette re-ordering is a well known and very effective approach for improving the compression of color indexed images. If the spatial distribution of the indexes in the image is s...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
This paper studies the convergence of a fixed point iteration algorithm for the problem of max-min signal-to-interference ratio (SIR) balancing. Differently from the existing wor...