move-to-front heuristic

E2172199 UNEXPLORED

The move-to-front heuristic is an algorithmic strategy for dynamically reordering items in a list by moving each accessed item to the front to improve average access time, especially when some items are requested more frequently than others.

Try in SPARQL Jump to: Surface forms Referenced by

All labels observed (1)

Label	Occurrences
move-to-front heuristic canonical	1

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.

Daniel Sleator → knownFor → move-to-front heuristic ⓘ