New results about the list access problem
We consider the list access problem and show that two unrealistic assumptions in the original cost model presented in and subsequent literature allow for several competitiveness resulst of the move-to-front heuristic (MTF). We present an off-line algorithm for the list access problem and prove that,...
| Autores: | , |
|---|---|
| Tipo de recurso: | informe técnico |
| Fecha de publicación: | 1996 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/370906 |
| Acceso en línea: | https://hdl.handle.net/2117/370906 |
| Access Level: | acceso abierto |
| Palabra clave: | Algorithms Algorismes Àrees temàtiques de la UPC::Informàtica |
| Sumario: | We consider the list access problem and show that two unrealistic assumptions in the original cost model presented in and subsequent literature allow for several competitiveness resulst of the move-to-front heuristic (MTF). We present an off-line algorithm for the list access problem and prove that, under a more realistic cost model, no on-line algorithm can be k-competitive for any constant k, MTF included. |
|---|