Average-Case Competitive Analyses for Ski-Rental Problems
暂无分享,去创建一个
[1] Richard M. Karp,et al. On-Line Algorithms Versus Off-Line Algorithms: How Much is it Worth to Know the Future? , 1992, IFIP Congress.
[2] Allan Borodin,et al. Competitive paging with locality of reference , 1991, STOC '91.
[3] Sally A. Goldman,et al. TCP dynamic acknowledgment delay (extended abstract): theory and practice , 1998, STOC '98.
[4] Sally A. Goldman,et al. TCP Dynamic Acknowledgment Delay: Theory and Practice (Extended Abstract). , 1998, STOC 1998.
[5] Gerhard J. Woeginger,et al. Online Algorithms , 1998, Lecture Notes in Computer Science.
[6] Sabah al-Binali,et al. The competitive analysis of risk taking with applications to online trading , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[7] Prabhakar Raghavan,et al. A Statistical Adversary for On-line Algorithms , 1991, On-Line Algorithms.
[8] Rudolf Fleischer. On the Bahncard problem , 2001, Theor. Comput. Sci..
[9] Kazuo Iwama,et al. Using Generalized Forecasts for Online Currency Conversion , 1999, COCOON.
[10] Christos H. Papadimitriou,et al. Beyond competitive analysis [on-line algorithms] , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[11] Ran El-Yaniv,et al. Competitive analysis of financial games , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[12] Marek Chrobak,et al. LRU Is Better than FIFO , 1999, SODA '98.
[13] Magnús M. Halldórsson,et al. Online independent sets , 2000, Theor. Comput. Sci..
[14] Anna R. Karlin,et al. Competitive randomized algorithms for non-uniform problems , 1990, SODA '90.
[15] Allan Borodin,et al. Online computation and competitive analysis , 1998 .
[16] Claire Mathieu,et al. Dynamic TCP acknowledgement and other stories about e/(e-1) , 2001, STOC '01.
[17] Allan Borodin,et al. An optimal on-line algorithm for metrical task system , 1992, JACM.