On-line Learning and the Metrical Task System Problem
暂无分享,去创建一个
Avrim Blum | Carl Burch | A. Blum | C. Burch | Avrim Blum
[1] References , 1971 .
[2] Allan Borodin,et al. An optimal online algorithm for metrical task systems , 1987, STOC.
[3] Manfred K. Warmuth,et al. The weighted majority algorithm , 1989, 30th Annual Symposium on Foundations of Computer Science.
[4] Amos Fiat,et al. Competitive Paging Algorithms , 1991, J. Algorithms.
[5] Allan Borodin,et al. An optimal on-line algorithm for metrical task system , 1992, JACM.
[6] Yuval Rabani,et al. A decomposition theorem and bounds for randomized server problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[7] David Haussler,et al. How to use expert advice , 1993, STOC.
[8] Yossi Azar,et al. On-line choice of on-line algorithms , 1993, SODA '93.
[9] Thomas H. Chung,et al. Approximate methods for sequential decision making using expert advice , 1994, COLT '94.
[10] Mark Herbster,et al. Tracking the Best Expert , 1995, Machine-mediated learning.
[11] Sandy Irani,et al. Randomized Algorithms for Metrical Task Systems , 1995, Theor. Comput. Sci..
[12] Yoav Freund,et al. A decision-theoretic generalization of on-line learning and an application to boosting , 1995, EuroCOLT.
[13] Yair Bartal,et al. Probabilistic approximation of metric spaces and its algorithmic applications , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[14] Andrew Tomkins,et al. A polylog(n)-competitive algorithm for metrical task systems , 1997, STOC '97.
[15] Andrew Tomkins,et al. Practical and theoretical issues in prefetching and caching , 1997 .
[16] Steven S. Seiden,et al. Unfair Problems and Randomized Algorithms for Metrical Task Systems , 1999, Inf. Comput..