Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Search

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

1 results

  • On some multi-request move-to-front heuristics

  • Part of
  • R. M. Phatarfod, A. J. Pryde
  • Journal:
    Journal of Applied Probability / Volume 35 / Issue 4 / December 1998
    Published online by Cambridge University Press:
    14 July 2016, pp. 911-918
    Print publication:
    December 1998

  • We consider the problem of self-organizing a linear list when the list is subjected to a random number of requests. Three separate move-to-front heuristics are considered. The difference between them lies in whether the items in the requested set are moved to the front in random order, or the same order as they were in originally, or in the order opposite to the one they were in originally. The eigenvalues of the transition probability matrices corresponding to the three heuristics are explicitly derived.