THE MOVE-TO-FRONT RULE FOR SELF-ORGANIZING LISTS WITH MARKOV DEPENDENT REQUESTS·
暂无分享,去创建一个
[1] Kai Lai Chung,et al. A Course in Probability Theory , 1949 .
[2] Man-Keung Siu,et al. SELF-ORGANIZING FILES WITH DEPENDENT ACCESSES , 1984 .
[3] P. Diaconis,et al. SHUFFLING CARDS AND STOPPING-TIMES , 1986 .
[4] Jon Louis Bentley,et al. Amortized analyses of self-organizing sequential search heuristics , 1985, CACM.
[5] Andrei Z. Broder,et al. Bounds on the cover time , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[6] James Allen Fill,et al. An exact formula for the move-to-front rule for self-organizing lists , 1996 .
[7] Daniel S. Hirschberg,et al. Self-organizing linear search , 1985, CSUR.
[8] William Feller,et al. An Introduction to Probability Theory and Its Applications , 1951 .
[9] Yaakov L. Varol,et al. A Note on Heuristics for Dynamic Organization of Data Structures , 1981, Inf. Process. Lett..
[10] James R. Bitner,et al. Heuristics That Dynamically Organize Data Structures , 1979, SIAM J. Comput..
[11] Ronald L. Rivest,et al. On self-organizing sequential search heuristics , 1976, CACM.
[12] Eliane R. Rodrigues. THE PERFORMANCE OF THE MOVE-TO-FRONT SCHEME UNDER SOME PARTICULAR FORMS OF MARKOV REQUESTS , 1995 .
[13] P. A. P. Moran,et al. An introduction to probability theory , 1968 .
[14] James Allen Fill,et al. Analysis of Top To Random Shuffles , 1992, Combinatorics, Probability and Computing.
[15] P. Diaconis,et al. Strong Stationary Times Via a New Form of Duality , 1990 .
[16] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .
[17] P. Diaconis,et al. Strong uniform times and finite random walks , 1987 .
[18] William Feller,et al. An Introduction to Probability Theory and Its Applications , 1967 .