Starting Time Selection Method of A New Request for Minimum and Maximum CLRs of Superposed VBR MPEG Videos and Its Applications - Part I. Scheduling
Vol. 24, No. 2, pp. 169-177, Feb. 1999
Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.
|
|
Cite this article
[IEEE Style]
노병희 and 김재균, "Starting Time Selection Method of A New Request for Minimum and Maximum CLRs of Superposed VBR MPEG Videos and Its Applications - Part I. Scheduling," The Journal of Korean Institute of Communications and Information Sciences, vol. 24, no. 2, pp. 169-177, 1999. DOI: .
[ACM Style]
노병희 and 김재균. 1999. Starting Time Selection Method of A New Request for Minimum and Maximum CLRs of Superposed VBR MPEG Videos and Its Applications - Part I. Scheduling. The Journal of Korean Institute of Communications and Information Sciences, 24, 2, (1999), 169-177. DOI: .
[KICS Style]
노병희 and 김재균, "Starting Time Selection Method of A New Request for Minimum and Maximum CLRs of Superposed VBR MPEG Videos and Its Applications - Part I. Scheduling," The Journal of Korean Institute of Communications and Information Sciences, vol. 24, no. 2, pp. 169-177, 2. 1999.
pISSN : 1226 - 4717
eISSN : 2287 - 3880