Charles H. Bennett, Aram W. Harrow, et al.
IEEE Trans. Inf. Theory
Given a set of variable length records and their access probabilities, we address the problem of allocating these records on a linear storage device so as to minimize the expected seek time. A partial characterization of the optimal arrangement is given and the general problem of finding an optimal solution is shown to be NP-hard. Next, two heuristics are considered and performance bounds are derived for them. Although these bounds are not very encouraging, both heuristics are found to perform well in practice. © 1981.
Charles H. Bennett, Aram W. Harrow, et al.
IEEE Trans. Inf. Theory
Rajiv Ramaswami, Kumar N. Sivarajan
IEEE/ACM Transactions on Networking
Michael C. McCord, Violetta Cavalli-Sforza
ACL 2007
Sabine Deligne, Ellen Eide, et al.
INTERSPEECH - Eurospeech 2001