Limiting behavior of the search cost distribution for the move-to-front rule in the stable case (Q645427): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: SIZE-BIASED PERMUTATION OF DIRICHLET PARTITIONS AND SEARCH-COST DISTRIBUTION / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limiting search cost distribution for the move-to-front rule with random request probabilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distribution of the search cost for the move-to-front rule with random weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4885223 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3084090 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4096243 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Serial Files with Relocatable Records / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributional results for means of normalized random measures with independent increments / rank
 
Normal rank
Property / cites work
 
Property / cites work: FINITE AUTOMATA AND MODELS OF SIMPLE FORMS OF BEHAVIOUR / rank
 
Normal rank

Latest revision as of 15:15, 4 July 2024

scientific article
Language Label Description Also known as
English
Limiting behavior of the search cost distribution for the move-to-front rule in the stable case
scientific article

    Statements

    Limiting behavior of the search cost distribution for the move-to-front rule in the stable case (English)
    0 references
    0 references
    0 references
    0 references
    15 November 2011
    0 references
    normalized random measure
    0 references
    random discrete distribution
    0 references
    stable subordinator
    0 references
    problem of heaps
    0 references

    Identifiers