{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T06:02:29Z","timestamp":1783576949517,"version":"3.55.0"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2000,4,1]],"date-time":"2000-04-01T00:00:00Z","timestamp":954547200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,4,1]],"date-time":"2000-04-01T00:00:00Z","timestamp":954547200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Machine Learning"],"published-print":{"date-parts":[[2000,4]]},"DOI":"10.1023\/a:1007621832648","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T05:54:50Z","timestamp":1040536490000},"page":"35-58","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":44,"title":["On-line Learning and the Metrical Task System Problem"],"prefix":"10.1007","volume":"39","author":[{"given":"Avrim","family":"Blum","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Carl","family":"Burch","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"254069_CR1","unstructured":"Azar, Y., Broder, A., & Manasse, M. (1993). On-line choice of on-line algorithms. Proc ACM-SIAM Symposium on Discrete Algorithms (pp. 432\u2013440)."},{"key":"254069_CR2","doi-asserted-by":"crossref","unstructured":"Bartal, Y. (1996). Probabilistic approximations of metric spaces and its algorithmic applications. Proc IEEE Symposium on Foundations of Computer Science (pp. 183\u2013193).","DOI":"10.1109\/SFCS.1996.548477"},{"key":"254069_CR3","doi-asserted-by":"crossref","unstructured":"Bartal, Y., Blum, A., Burch, C., & Tomkins, A. (1997). A polylog(n)-competitive algorithm for metrical task systems. Proc ACM Symposium on Theory of Computing (pp. 711\u2013719).","DOI":"10.1145\/258533.258667"},{"key":"254069_CR4","doi-asserted-by":"crossref","unstructured":"Blum, A., Karloff, H., Rabani, Y., & Saks, M. (1992). A decomposition theorem and lower bounds for randomized server problems. Proc IEEE Symposium on Foundations of Computer Science (pp. 197\u2013207).","DOI":"10.1109\/SFCS.1992.267772"},{"issue":"4","key":"254069_CR5","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1145\/146585.146588","volume":"39","author":"A. Borodin","year":"1992","unstructured":"Borodin, A., Linial, N., & Saks, M. (1992). An optimal online algorithm for metrical task systems. J. of the ACM, 39(4), 745\u2013763.","journal-title":"J. of the ACM"},{"key":"254069_CR6","doi-asserted-by":"crossref","unstructured":"Cesa-Bianchi, N., Freund, Y., Helmbold, D., Haussler, D., Schapire, R., & Warmuth, M. (1993). How to use expert advice. Proc ACM Symposium on Theory of Computing (pp. 382\u2013391).","DOI":"10.1145\/167088.167198"},{"key":"254069_CR7","first-page":"183","volume-title":"Proc ACMWorkshop on Computational Learning Theory","author":"T. Chung","year":"1994","unstructured":"Chung, T. (1994). Approximate methods for sequential decision making using expert advice. Proc ACMWorkshop on Computational Learning Theory (pp. 183\u2013189). New York, NY: ACM Press."},{"key":"254069_CR8","unstructured":"Eskicioglu, M. (1990). Process migration in distributed systems: A comparitive survey. Tech. Rep. TR 90\u20133, University of Alberta."},{"key":"254069_CR9","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1016\/0196-6774(91)90041-V","volume":"12","author":"A. Fiat","year":"1991","unstructured":"Fiat, A., Karp, R., Luby, M., McGeoch, L., Sleator, D., & Young, N. (1991). Competitive paging algorithms. J. of Algorithms, 12, 685\u2013699.","journal-title":"J. of Algorithms"},{"issue":"1","key":"254069_CR10","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1006\/jcss.1997.1504","volume":"55","author":"Y. Freund","year":"1997","unstructured":"Freund, Y. & Schapire, R. (1997). A decision-theoretic generalization of on-line learning and an application to boosting. J. Comp Syst Sci, 55(1), 119\u2013139.","journal-title":"J. Comp Syst Sci"},{"issue":"2","key":"254069_CR11","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1023\/A:1007424614876","volume":"32","author":"M. Herbster","year":"1998","unstructured":"Herbster, M. & Warmuth, M. (1998). Tracking the best expert. Machine Learning, 32(2), 286\u2013294.","journal-title":"Machine Learning"},{"issue":"1\u20132","key":"254069_CR12","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/S0304-3975(97)00006-6","volume":"194","author":"S. Irani","year":"1998","unstructured":"Irani, S. & Seiden, S. (1998). Randomized algorithms for metrical task systems. Theoretical Computer Science, 194(1\u20132), 163\u2013182.","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"254069_CR13","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1006\/inco.1994.1009","volume":"108","author":"N. Littlestone","year":"1994","unstructured":"Littlestone, N. & Warmuth, M. (1994). The weighted majority algorithm. Information and Computation, 108(2), 212\u2013261.","journal-title":"Information and Computation"},{"issue":"2","key":"254069_CR14","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1006\/inco.1998.2744","volume":"148","author":"S. Seiden","year":"1999","unstructured":"Seiden, S. (1999). Unfair problems and randomized algorithms for metrical task systems. Information and Computation, 148(2), 219\u2013240.","journal-title":"Information and Computation"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1007621832648.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1007621832648\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1007621832648.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,10]],"date-time":"2025-07-10T11:41:14Z","timestamp":1752147674000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1007621832648"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,4]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,4]]}},"alternative-id":["254069"],"URL":"https:\/\/doi.org\/10.1023\/a:1007621832648","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,4]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}