On self-organizing sequential search heuristics

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 ...

Two sets of algorithms for searching and dynamic reorganization of linear lists are presented. Each set forms a spectrum, with the well-known move-to-front and transposition algorithms at the extrema. A linear ordering on the stationary expected search ...

Suboptimal search algorithms offer shorter solving times by sacrificing guaranteed solution optimality. While optimal search algorithms like A* and IDA* require admissible heuristics, suboptimal search algorithms need not constrain their guidance in ...