298 search results - page 5 / 60 » Competitive Analysis of Flash-Memory Algorithms |
SODA
2010
ACM
15 years 7 months ago
2010
ACM
We design and analyze an on-line reordering buffer management algorithm with improved O log k log log k competitive ratio for non-uniform costs, where k is the buffer size. This i...
MFCS
1994
Springer
15 years 1 months ago
1994
Springer
We consider the question of lookahead in the list update problem: What improvement can be achieved in terms of competitiveness if an on-line algorithm sees not only the present re...
SODA
2008
ACM
14 years 11 months ago
2008
ACM
In this paper, we study an online make-to-order variant of the classical joint replenishment problem (JRP) that has been studied extensively over the years and plays a fundamental...
CSO
2009
IEEE
15 years 4 months 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...
IAT
2008
IEEE
15 years 4 months ago
2008
IEEE
The automation of agents that bargain within markets is a challenging open problem. In these settings a seller agent can take advantage from the competition among several buyer ag...