Average-Case Analysis for Special Cases of Online Bahncard Problem
暂无分享,去创建一个
[1] Yin-Feng Xu,et al. Competitive Algorithms for Online Leasing Problem in Probabilistic Environments , 2004, ISNN.
[2] Allan Borodin,et al. Online computation and competitive analysis , 1998 .
[3] Yin-Feng Xu,et al. New Results on Online Replacement Problem , 2005, WINE.
[4] Christos H. Papadimitriou,et al. Beyond competitive analysis [on-line algorithms] , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[5] Rudolf Fleischer. On The Bahncard Problem , 1998, COCOON.
[6] Jian Chen,et al. A Risk-Reward Competitive Analysis of the Bahncard Problem , 2005, AAIM.
[7] Claire Mathieu,et al. Dynamic TCP acknowledgement and other stories about e/(e-1) , 2001, STOC '01.
[8] Ran El-Yaniv,et al. Competitive Optimal On-Line Leasing , 1999, Algorithmica.
[9] Allan Borodin,et al. On the power of randomization in on-line algorithms , 2005, Algorithmica.
[10] Richard M. Karp,et al. On-Line Algorithms Versus Off-Line Algorithms: How Much is it Worth to Know the Future? , 1992, IFIP Congress.
[11] Kazuo Iwama,et al. Average-Case Competitive Analyses for Ski-Rental Problems , 2002, ISAAC.
[12] Lyle A. McGeoch,et al. Competitive algorithms for on-line problems , 1988, STOC '88.