On the distribution of search cost for the move-to-front rule
Random Structures & Algorithms
Limits and rates of convergence for the distribution of search cost under the move-to-front rule
Theoretical Computer Science
On self-organizing sequential search heuristics
Communications of the ACM
Hi-index | 0.00 |
The move-to-front rule is applied on a model where several records are accessed each time. The records will then be placed in the front positions randomly or with the former relative order between themselves preserved. Equilibrium distributions are explored. Comparison of expected stationary search costs is carried out.