103 search results - page 2 / 21 » On the Competitive Ratio of the Work Function Algorithm for ... |
ESA
2005
Springer
13 years 11 months ago
2005
Springer
We consider a one dimensional storage system where each container can store a bounded amount of capacity as well as a bounded number of items k ≥ 2. This defines the (standard)...
SIAMCOMP
2012
11 years 7 months ago
2012
We consider online algorithms for the generalized caching problem. Here we are given a cache of size k and pages with arbitrary sizes and fetching costs. Given a request sequence ...
CSO
2009
IEEE
14 years 7 days ago
2009
IEEE
When a paid price discount activity occurs, the decisionmaker must decide whether or not and when to pay the additional fees for preferential price in an online fashion. This prob...
SODA
2012
ACM
11 years 8 months ago
2012
ACM
We propose a general dual-fitting technique for analyzing online scheduling algorithms in the unrelated machines setting where the objective function involves weighted flow-time...
CORR
2011
Springer
13 years 14 days ago
2011
Springer
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...