Zobrazeno 1 - 3
of 3
pro vyhledávání: '"PROBLEM OF HEAPS"'
Publikováno v:
Statistics and Probability Letters
Statistics and Probability Letters, Elsevier, 2011, 81 (12), pp.1827--1832
HAL
Statistics and Probability Letters, Elsevier, 2011, 81 (12), pp.1827--1832
HAL
Move-to-front rule is a heuristic updating a list of n items according to requests. Items are required with unknown probabilities (or popularities). The induced Markov chain is known to be ergodic. One main problem is the study of the distribution of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e2d432fd3787e465ca57e73a442192b9
https://hal.archives-ouvertes.fr/hal-00868089
https://hal.archives-ouvertes.fr/hal-00868089
Move-to-front rule is a heuristic updating a list of n items according to requests. Items are required with unknown probabilities (or popularities). The induced Markov chain is known to be ergodic. A main problem is the study of the distribution of t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e02a600744f00dc727b1f223c848f2b1
http://hdl.handle.net/11565/3995541
http://hdl.handle.net/11565/3995541
Publikováno v:
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
instname
HAL
instname
HAL
Move-to-front rule is a heuristic updating a list of n items according to requests. Items are required with unknown probabilities (or popularities). The induced Markov chain is known to be ergodic. One main problem is the study of the distribution of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::34e315d85227f19e09bfe88f6095cf21
http://hdl.handle.net/10016/12114
http://hdl.handle.net/10016/12114