Economical caching

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 3, Issue , 2009, Pages 385-396

  Englert, Matthias ^a   Röglin, Heiko ^b   Spönemann, Jacob ^c   Vöcking, Berthold ^c  

^a UNIVERSITY OF WARWICK   (United Kingdom)

^b BOSTON UNIVERSITY   (United States)

^c RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

Competitive analysis; Online algorithms; Storage management

Indexed keywords

BATTERY MANAGEMENT; COMPETITIVE ANALYSIS; COMPETITIVE RATIO; CURRENT CONSUMPTION; DETERMINISTIC ALGORITHMS; LAMBERT W FUNCTION; OFF-LINE ALGORITHM; ON-LINE ALGORITHMS;

COMPUTER SCIENCE; COSTS; MOBILE DEVICES; OPTIMIZATION; PURCHASING; SALES; STORAGE MANAGEMENT;

ALGORITHMS;

EID: 84880195015     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (6)

1. Allan Borodin and Ran El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998.
2. Thomas M. Cover and Erik Ordentlich. Universal portfolios with side information. IEEE Transactions on Information Theory, 42(2):348-363, 1996.
3. Ran El-Yaniv. Competitive solutions for online financial problems. ACM Comput. Surv., 30(1):28-69, 1998.
4. Ran El-Yaniv, Amos Fiat, Richard M. Karp, and G. Turpin. Optimal search and one-way trading online algorithms. Algorithmica, 30(1):101-139, 2001.
5. David P. Helmbold, Robert E. Schapire, Yoram Singer, and Manfred K. Warmuth. On-line portfolio selection using multiplicative updates. In ICML, pages 243-251, 1996.
6. Erik Ordentlich and Thomas M. Cover. On-line portfolio selection. In COLT, pages 310-313, 1996.