Searching for "On Self-Organizing Sequential Search Heuristics." – sorted by Relevance.
-
State-transitive Markov processes, random walks on groups, and self-organizing data structures
- is called an "on-line self-organizing sequential search heuristic". In order to indicate the dependence
- Add To MetaCart
-
Optimality Of The Move-To-Front Heuristic For Self-Organizing Data Structures
- cost. 1. Introduction. Let us describe a simple example of a self-organizing sequential search data
- Cited by 1 (0 self) – Add To MetaCart
-
Competitive Algorithms for On-line Paging and Graph Coloring
- . On self-organizing sequential search heuristics. ACM, Vol. 19, pages 63-67, 1976. [57] M. Saks. Personal
- Add To MetaCart

