Limiting search cost distribution for the move-to-front rule with random request probabilities
type: Item
instance of: scholarly article
title: Limiting search cost distribution for the move-to-front rule with random request probabilities
zbMATH Open document ID: 1142.68621
author: Javiera Barrera
author: Christian Paroissin
author: Thierry E. Huillet
published in: Operations Research Letters
publication date: 2008-03-28T00:00:00Z
full work available at URL: https://arxiv.org/abs/math/0506343
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 60C05
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68P20
zbMATH DE Number: 5255508
zbMATH Keywords: move-to-front
zbMATH Keywords: search cost
zbMATH Keywords: random discrete distribution
zbMATH Keywords: limiting distribution
zbMATH Keywords: size-biased permutation
MaRDI profile type: Publication
OpenAlex ID: W2243361254
arXiv ID: math/0506343
cites work: SIZE-BIASED PERMUTATION OF DIRICHLET PARTITIONS AND SEARCH-COST DISTRIBUTION
cites work: On the distribution of the search cost for the move-to-front rule with random weights
cites work: The heaps process, libraries, and size-biased permutations
cites work: Q5624436
cites work: Limits and rates of convergence for the distribution of search cost under the move-to-front rule
cites work: Q4885223
cites work: Birthday paradox, coupon collectors, caching algorithms and self- organizing search
cites work: Q4096243
cites work: Q4493303
cites work: On Serial Files with Relocatable Records
cites work: Q3997837
cites work: Q4301147
cites work: Q4445977
cites work: Q3321201
cites work: FINITE AUTOMATA AND MODELS OF SIMPLE FORMS OF BEHAVIOUR
cites work: Q5561562
DOI: 10.1016/J.ORL.2005.09.007
description: scientific article