Self-Organization and AnnealingReport
We investigate the use of self-organization techniques in conjunction with simulated annealing to reorganize the records of a list to find a static ordering that minimizes expected search time. Each search begins where the previous search ended. The work began with the simpler and related problem of annealed self - organized linear lists which is of interest in itself. We review the known algorithms and propose new time varying rules that give better performance and are probabilistically optimal in the limit. The most surprising result is that utility of annealing is greatly reduced in the short run when using the new self - organization rules. The results were superior to more complicated techniques.
Note: Abstract extracted from PDF file via OCR
All rights reserved (no additional license for public reuse)
Richards, Dana. "Self-Organization and Annealing." University of Virginia Dept. of Computer Science Tech Report (1985).
University of Virginia, Department of Computer Science