Storing continuous-media data on a compact disc
暂无分享,去创建一个
[1] Jan Karel Lenstra,et al. Scheduling Periodic Tasks , 1996, INFORMS J. Comput..
[2] Edward G. Coffman,et al. A generalized bound on LPT sequencing , 1976, SIGMETRICS '76.
[3] Doug Shepherd,et al. The Design of a Storage Server for Continuous Media , 1993, Comput. J..
[4] P. Venkat Rangan,et al. Efficient Storage Techniques for Digital Continuous Multimedia , 1993, IEEE Trans. Knowl. Data Eng..
[5] Brenda S. Baker,et al. A 5/4 Algorithm for Two-Dimensional Packing , 1981, J. Algorithms.
[6] Eugene L. Lawler,et al. Sequencing and scheduling: algorithms and complexity , 1989 .
[7] Clement T. Yu,et al. Efficient placement of audio data on optical disks for real-time applications , 1989, CACM.
[8] Ronald L. Graham,et al. Bounds for certain multiprocessing anomalies , 1966 .
[9] David S. Johnson,et al. Approximation Algorithms for Bin-Packing — An Updated Survey , 1984 .
[10] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[11] Ronald L. Graham,et al. Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.
[12] Edward G. Coffman,et al. Average-case analysis of cutting and packing in two dimensions , 1990 .
[13] Jan Karel Lenstra,et al. Periodic Multiprocessor Scheduling , 1991, PARLE.
[14] Jim Gemmell,et al. Principles of delay sensitive multi-media data retrieval , 1991 .
[15] David S. Johnson,et al. An experimental study of bin packing , 1983 .
[16] Eugene L. Lawler,et al. Traveling Salesman Problem , 2016 .
[17] Stavros Christodoulakis,et al. Principles of delay-sensitive multimedia data storage retrieval , 1992, TOIS.