Affiliation:
1. Massachusetts Institute of Technology, Cambridge
Abstract
This paper examines a class of heuristics for maintaining a sequential list in approximately optimal order with respect to the average time required to search for a specified element, assuming that each element is searched for with a fixed probability independent of previous searches performed. The “move to front” and “transposition” heuristics are shown to be optimal to within a constant factor, and the transposition rule is shown to be the more efficient of the two. Empirical evidence suggests that transposition is in fact optimal for any distribution of search probabilities.
Publisher
Association for Computing Machinery (ACM)
Cited by
155 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Defending Hash Tables from Subterfuge with Depth Charge;Proceedings of the 25th International Conference on Distributed Computing and Networking;2024-01-04
2. Self-Adjusting Partially Ordered Lists;IEEE INFOCOM 2023 - IEEE Conference on Computer Communications;2023-05-17
3. Bibliography;Engineering a Compiler;2023
4. Data Structures;Engineering a Compiler;2023
5. Functional central limit theorem for tagged particle dynamics in stochastic ranking process with space-time dependent intensities;Latin American Journal of Probability and Mathematical Statistics;2022