| Amortized Analyses of Self-Organizing Sequential Search Heuristics (2008) | |||||||||||||
Abstract | |||||||||||||
| ABSTRACT: The performance of sequential search can be enhanced by the use of heuristics that move elements closer to the front of the list as they are found. Previous analyses have characterized the performance of such heuristics probabilistically. In this article,, we use amortization to analyze the heuristics in a worst-case sense; the relative merit of the heuristics in this analysis is different in the probabilistic analyses. Experiments show that the behavior of the heuristics on real data is more closely described by the amortized analyses than by the probabilistic analyses. 1. | |||||||||||||
Details der Publikation | |||||||||||||
| |||||||||||||