(algorithmic technique)
Definition: Heuristic that reorders a list of elements according to how the elements are accessed.
See also move-to-front heuristic, frequency count heuristic, transpose sequential search, self-organizing list.
Note: From Algorithms and Theory of Computation Handbook, page 2-14, Copyright © 1999 by CRC Press LLC. Appearing in the Dictionary of Computer Science, Engineering and Technology, Copyright © 2000 CRC Press LLC.
Author: CRC-A
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 17 December 2004.
HTML page formatted Mon Sep 11 09:46:07 2006.
Cite this as:
Algorithms and Theory of Computation Handbook, CRC Press LLC, 1999, "self-organizing heuristic", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 17 December 2004. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/selforganiz.html
