Abstract
We consider the question of lookahead in the list update problem: What improvement can be achieved in terms of competitiveness if an on-line algorithm sees not only the present request to be served but also some future requests? We introduce two different models of lookahead and study the list update problem using these models. In addition to lower bounds we present a number of competitive on-line algorithms with lookahead.
Cite
CITATION STYLE
Albers, S. (1994). A competitive analysis of the list update problem with lookahead. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 841 LNCS, pp. 201–210). Springer Verlag. https://doi.org/10.1007/3-540-58338-6_67
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
