乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T01:42:29Z","timestamp":1725500549103},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540775652"},{"type":"electronic","value":"9783540775669"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77566-9_21","type":"book-chapter","created":{"date-parts":[[2008,1,5]],"date-time":"2008-01-05T01:18:43Z","timestamp":1199495923000},"page":"247-258","source":"Crossref","is-referenced-by-count":34,"title":["How Much Information about the Future Is Needed?"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Dobrev","sequence":"first","affiliation":[]},{"given":"Rastislav","family":"Kr\u00e1lovi\u010d","sequence":"additional","affiliation":[]},{"given":"Dana","family":"Pardubsk\u00e1","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10107-003-0436-0","volume":"97","author":"S. Albers","year":"2003","unstructured":"Albers, S.: Online algorithms: A survey. Mathematical Programming\u00a097, 3\u201326 (2003)","journal-title":"Mathematical Programming"},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1147\/sj.52.0078","volume":"5","author":"L.A. Belady","year":"1966","unstructured":"Belady, L.A.: A study of replacement algorithms for virtual storage computers. IBM Systems Journal\u00a05, 78\u2013101 (1966)","journal-title":"IBM Systems Journal"},{"issue":"1","key":"21_CR3","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/BF01294264","volume":"11","author":"S. Ben-David","year":"1994","unstructured":"Ben-David, S., Borodin, A.: A new measure for the study of on-line algorithms. Algorithmica\u00a011(1), 73\u201391 (1994)","journal-title":"Algorithmica"},{"key":"21_CR4","volume-title":"Online Computation and Competitive Analysis","author":"A. Borodin","year":"1998","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Borodin, A., Irani, S., Raghavan, P., Schieber, B.: Competitive paging with locality of reference. In: Proc. 23rd Annual ACM Symp. on Theory of Computing, pp. 249\u2013259 (1991)","DOI":"10.1145\/103418.103422"},{"key":"21_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/3-540-44849-7_13","volume-title":"Algorithms and Complexity","author":"J. Boyar","year":"2003","unstructured":"Boyar, J., Favrholdt, L.M.: The Relative Worst Order Ratio for Online Algorithms. In: Petreschi, R., Persiano, G., Silvestri, R. (eds.) CIAC 2003. LNCS, vol.\u00a02653, pp. 58\u201369. Springer, Heidelberg (2003)"},{"key":"21_CR7","unstructured":"Dobrev, S., Kr\u00e1lovi\u010d, R., Pardubsk\u00e1, D.: How Much Information About the Future is Needed?, Technical report TR-2007-007, Faculty of Mathematics, Physics, and Informatics, Comenius University, Bratislava, http:\/\/kedrigern.dcs.fmph.uniba.sk\/reports\/display.php?id=22"},{"key":"21_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/11841036_33","volume-title":"Algorithms \u2013 ESA 2006","author":"M. Englert","year":"2006","unstructured":"Englert, M., Westermann, M.: Lower and Upper Bounds on FIFO Buffer Management in QoS Switches. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol.\u00a04168, pp. 352\u2013363. Springer, Heidelberg (2006)"},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1016\/0196-6774(91)90041-V","volume":"12","author":"A. Fiat","year":"1991","unstructured":"Fiat, A., Karp, R.M., Luby, M., McGeoch, L.A., Sleator, D.D., Young, N.E.: Competitive Paging Algorithms. J. Algorithms\u00a012, 685\u2013699 (1991)","journal-title":"J. Algorithms"},{"key":"21_CR10","series-title":"Lecture Notes in Computer Science","volume-title":"ICALP 2007","author":"P. Fraigniaud","year":"2007","unstructured":"Fraigniaud, P., Gavoille, C., Ilcinkas, D., Pelc, A.: Distributed computing with advice: information sensitivity of graph coloring. In: Arge, L., et al. (eds.) ICALP 2007. LNCS, vol.\u00a04596, Springer, Heidelberg (2007)"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., Ilcinkas, D., Pelc, A.: Oracle size: a new measure of difficulty for communication problems. In: PODC 2006. Proc. 25th Ann. ACM Symposium on Principles of Distributed Computing, pp. 179\u2013187 (2006)","DOI":"10.1145\/1146381.1146410"},{"key":"21_CR12","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"R.L. Graham","year":"1966","unstructured":"Graham, R.L.: Bounds for Certain Multiprocessing Anomalies. Bell Systems Technical Journal\u00a045, 1563\u20131581 (1966)","journal-title":"Bell Systems Technical Journal"},{"key":"21_CR13","unstructured":"Irany, S., Karlin, A.R.: Online Computation. In: Hochbaum, D.S. (ed.) Approximation Algorithms for NP-Hard Problems, pp. 521\u2013564. PWS Publishing Company (1997)"},{"key":"21_CR14","unstructured":"Irani, S., Karlin, A.R., Phillips, S.: Strongly competitive algorithms for paging with locality of reference. In: Proc. 3rd Annual ACM-SIAM Symp. on Discrete Algorithms, pp. 228\u2013236 (1992)"},{"key":"21_CR15","unstructured":"Kalyanasundaram, B., Pruhs, K.: Speed is as Powerful as Clairvoyance. In: IEEE Symposium on Foundations of Computer Science, pp. 214\u2013221 (1995)"},{"key":"21_CR16","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/BF01762111","volume":"3","author":"A.R. Karlin","year":"1988","unstructured":"Karlin, A.R., Manasse, M.S., Rudolph, L., Sleator, D.D.: Competitive Snoopy Caching. Algorithmica\u00a03, 79\u2013119 (1988)","journal-title":"Algorithmica"},{"key":"21_CR17","unstructured":"Karp, R.: On-line algorithms versus off-line algorithms: how much is it worth to know the future? In: Proc. IFIP 12th World Computer Congress, vol.\u00a01, pp. 416\u2013429 (1992)"},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"Koutsoupias, E., Papadimitriou, C.H.: Beyond competitive analysis. In: Proc. 34th Annual Symp. on Foundations of Computer Science, pp. 394\u2013400 (1994)","DOI":"10.1109\/SFCS.1994.365677"},{"key":"21_CR19","doi-asserted-by":"crossref","unstructured":"Lotker, Z., Patt-Shamir, B.: Nearly Optimal FIFO Buffer Management for DiffServ. In: PODC 2002, pp. 134\u2013143 (2002)","DOI":"10.1145\/571825.571851"},{"key":"21_CR20","doi-asserted-by":"crossref","unstructured":"Manasse, M.M., McGeoch, L.A., Sleator, D.D.: Competitive Algorithms for Online Problems. In: Proc. 20th Annual Symposium on the Theory of Computing, pp. 322\u2013333 (1988)","DOI":"10.1145\/62212.62243"},{"key":"21_CR21","doi-asserted-by":"crossref","unstructured":"Philips, C.A., Stein, C., Torng, E., Wein, J.: Optimal Time-Critical Scheduling via Resource Augmentation. In: Proc. 29th Annual ACM Symp on the Theory of Computing, pp. 140\u2013149 (1997)","DOI":"10.1145\/258533.258570"},{"key":"21_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/3-540-56402-0_57","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"U.M. O\u2019Reilly","year":"1993","unstructured":"O\u2019Reilly, U.M., Santoro, N.: The Expressiveness of Silence: Tight Bounds for Synchronous Communication of Information Using Bits and Silence. In: Mayr, E.W. (ed.) WG 1992. LNCS, vol.\u00a0657, pp. 321\u2013332. Springer, Heidelberg (1993)"},{"key":"21_CR23","doi-asserted-by":"crossref","unstructured":"Raghavan, P.: A statistical adversary for on-line algorithms. In: On-Line Algorithms, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pp. 79\u201383 (1991)","DOI":"10.1090\/dimacs\/007\/05"},{"issue":"2","key":"21_CR24","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D.D. Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Amortized Efficiency of Update and Paging Rules. Comm. of the ACM\u00a028(2), 202\u2013208 (1985)","journal-title":"Comm. of the ACM"},{"key":"21_CR25","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/PL00009192","volume":"20","author":"E. Torng","year":"1998","unstructured":"Torng, E.: A Unified Analysis of Paging and Caching. Algorithmica\u00a020, 175\u2013200 (1998)","journal-title":"Algorithmica"},{"key":"21_CR26","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/BF01189992","volume":"11","author":"N. Young","year":"1994","unstructured":"Young, N.: The k-server dual and loose competitiveness for paging. Algorithmica\u00a011, 525\u2013541 (1994)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2008: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77566-9_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:44:52Z","timestamp":1619505892000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77566-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540775652","9783540775669"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77566-9_21","relation":{},"subject":[]}}