메뉴 건너뛰기




Volumn , Issue , 1997, Pages 516-526

Resource scheduling in enhanced pay-per-view continuous media databases

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; DIGITAL STORAGE; OPTIMIZATION; POLYNOMIAL APPROXIMATION; POLYNOMIALS; SCHEDULING; TELEVISION BROADCASTING;

EID: 84994158612     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (9)

References (23)
  • 3
    • 0027879748 scopus 로고
    • Optimization of the grouped sweeping scheduling (gss) with heterogeneous multimedia streams
    • August
    • M.-S. Chen, D. D. Kandlur, and P. S. Yu. "Optimization of the Grouped Sweeping Scheduling (GSS) with Heterogeneous Multimedia Streams". In Proc. of ACM Multimedia '93, August 1993.
    • (1993) Proc. of ACM Multimedia '93
    • Chen, M.-S.1    Kandlur, D.D.2    Yu, P.S.3
  • 7
    • 0001099866 scopus 로고
    • Fast approximation algorithms for knapsack problems
    • E. L. Lawler. "Fast Approximation Algorithms for Knapsack Problems". Math, of Operations Research, 4(4):339-356,1979.
    • (1979) Math, of Operations Research , vol.4 , Issue.4 , pp. 339-356
    • Lawler, E.L.1
  • 8
    • 0000043334 scopus 로고
    • Popularity-based assignment of movies to storage devices in a video-on-demand system
    • T.D.C. Little and D. Venkatesh. "Popularity-Based Assignment of Movies to Storage Devices in a Video-on-Demand System". ACM Multimedia Systems, 2:280-287,1995.
    • (1995) ACM Multimedia Systems , vol.2 , pp. 280-287
    • Little, T.D.C.1    Venkatesh, D.2
  • 9
    • 84974687699 scopus 로고
    • Scheduling algorithms for multiprogramming in a hard-real-time environment
    • C. L. Liu and J. W. Layland. "Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment". Journal of the ACM, 20(1):46-61,1973.
    • (1973) Journal of the ACM , vol.20 , Issue.1 , pp. 46-61
    • Liu, C.L.1    Layland, J.W.2
  • 12
  • 17
  • 18
    • 0016437461 scopus 로고
    • Approximate algorithms for the 0/1 knapsack problem
    • S. Sahni. "Approximate Algorithms for the 0/1 Knapsack Problem". Journal of the ACM, 22(1):115-124,1975.
    • (1975) Journal of the ACM , vol.22 , Issue.1 , pp. 115-124
    • Sahni, S.1
  • 22
    • 0020764597 scopus 로고
    • On a periodic maintenance problem
    • W.D. Wei and C.L. Liu. "On a Periodic Maintenance Problem". Operations Research Letters, 2(2):90-93,1983.
    • (1983) Operations Research Letters , vol.2 , Issue.2 , pp. 90-93
    • Wei, W.D.1    Liu, C.L.2
  • 23
    • 0024699125 scopus 로고
    • Efficient placement of audio data on optical disks for real-time applications
    • C. Yu, W. Sun, D. Bitton, Q. Yang, R. Bruno, and J. Tullis. "Efficient Placement of Audio Data on Optical Disks for Real-Time Applications". Comm. of the ACM, 32(7):862-871,1989.
    • (1989) Comm. of the ACM , vol.32 , Issue.7 , pp. 862-871
    • Yu, C.1    Sun, W.2    Bitton, D.3    Yang, Q.4    Bruno, R.5    Tullis, J.6


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.