Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-17T07:49:56.789Z Has data issue: false hasContentIssue false

Cost comparison of a spectrum of self-organizing rules

Published online by Cambridge University Press:  14 July 2016

K. S. Chong*
Affiliation:
The University of Hong Kong
K. Lam*
Affiliation:
The University of Hong Kong
*
∗ Postal address: Statistics Department, The University of Hong Kong, Hong Kong.
∗ Postal address: Statistics Department, The University of Hong Kong, Hong Kong.

Abstract

Consider the following self-organizing rule called POS(i): after a book in the jth position of a shelf is borrowed, it is moved up one position if ji, and is moved to the ith position if j > i. This is a family of move-forward rules, with POS(l) being the move-to-front rule and POS(n − 1) being the transposition rule where n is the number of books to be organized. We derive explicitly the stationary distribution under the POS(i) rule and show that its search cost compares favorably with that of move-to-front rule under any book access probabilities p 1, p 1, ···, pn .

Information

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 1997 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable