Cost comparison of a spectrum of self-organizing rules
Journal of Applied Probability1997Vol. 34(3), pp. 583–592
Abstract
Consider the following self-organizing rule called POS( i ): after a book in the j th position of a shelf is borrowed, it is moved up one position if j i , and is moved to the i th 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 , ···, p n .
Related Papers
- → Transposition of teeth(1979)37 cited
- → Suppression of Winding AC Copper Loss in High-Speed Electrical Machines by a Practical Transposition Technique(2022)12 cited
- → The structure of didactic transposition capability - analysis of an example of didactic transposition of physical knowledge in the training of pedagogical students(2020)1 cited
- Study on Electric Imbalance and Transposition of 750 kV 1-Tower Double-Circuit Transmission Line(2007)
- Optimization of Conductor Transposition and Configuration of Insulated Ground Wire on Overhead Transmission Line(2000)