News
Computing an optimal CCP is a binary nonlinear programming problem in n variables. This paper specializes to k-out-of-n systems and develops a branch-and-bound algorithm for finding an optimal ...
A. Kramli, J. Soltesz, On the Optimality of the 'Least Frequently Used' Page Replacement Algorithm, Advances in Applied Probability, Vol. 10, No. 2 (Jun., 1978), p. 338 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback