Dynamic placement of records and the classical occupancy problem

摘要: Abstract This paper considers some mathematical problems of dynamic allocation as customers arrive to a linear storage. We show the connection between placement problem and well-known classical occupancy problem. The discusses approximation expected distance consecutive requests on basis continuous record reference distribution. model when access probabilities records are estimated by sample order statistics uniformly distributed random variables is also discussed. On Bayesian approach programming solution given.