Limits and rates of convergence for the distribution of search cost under the move-to-front rule

Author： Fill J.A.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.164, Iss.1, 1996-09, pp. : 185-206

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

On the competitiveness of the move-to-front rule

By Martnez C.   Roura S.  

Theoretical Computer Science, Vol. 242, Iss. 1, 2000-07 ,pp. : 313-325

Elsevier

Access to resources Recommend Favorite

On the convergence rates of genetic algorithms

By He J.   Kang L.  

Theoretical Computer Science, Vol. 229, Iss. 1, 1999-11 ,pp. : 23-39

Elsevier

Access to resources Recommend Favorite

On the asymptotic optimality of the cμ/θ rule under ergodic cost

By Atar Rami   Giat Chanit   Shimkin Nahum  

Queueing Systems, Vol. 67, Iss. 2, 2011-02 ,pp. : 127-144

Springer Publishing Company

Access to resources Recommend Favorite

RAID 60 Storage Reliability and Cost Optimization Using Weibull Distribution and Cuckoo Search Algorithm with Lévy Flights

By  

International Journal of Applied Metaheuristic Computing (IJAMC), Vol. 9, Iss. 3, 2018-07 ,pp. : 13-39

IGI Global_journal

Access to resources Recommend Favorite

On the rate of convergence of error estimates for the partitioning classification rule

By Pinter  

Theoretical Computer Science, Vol. 284, Iss. 1, 2002-07 ,pp. : 181-196

Elsevier

Access to resources Recommend Favorite