Conference paper
Identity delegation in policy based systems
Rajeev Gupta, Shourya Roy, et al.
ICAC 2006
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.
Rajeev Gupta, Shourya Roy, et al.
ICAC 2006
Marshall W. Bern, Howard J. Karloff, et al.
Theoretical Computer Science
Charles H. Bennett, Aram W. Harrow, et al.
IEEE Trans. Inf. Theory
John M. Boyer, Charles F. Wiecha
DocEng 2009