On-line Scheduling Algorithms for Reducing the Largest Weighted Error Incurred by Imprecise Tasks
Vol. 24, No. 6, pp. 1032-1041, Jun. 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]
이춘희, 류원, 송기현, 최경희, 정기현, 박승규, "On-line Scheduling Algorithms for Reducing the Largest Weighted Error Incurred by Imprecise Tasks," The Journal of Korean Institute of Communications and Information Sciences, vol. 24, no. 6, pp. 1032-1041, 1999. DOI: .
[ACM Style]
이춘희, 류원, 송기현, 최경희, 정기현, and 박승규. 1999. On-line Scheduling Algorithms for Reducing the Largest Weighted Error Incurred by Imprecise Tasks. The Journal of Korean Institute of Communications and Information Sciences, 24, 6, (1999), 1032-1041. DOI: .
[KICS Style]
이춘희, 류원, 송기현, 최경희, 정기현, 박승규, "On-line Scheduling Algorithms for Reducing the Largest Weighted Error Incurred by Imprecise Tasks," The Journal of Korean Institute of Communications and Information Sciences, vol. 24, no. 6, pp. 1032-1041, 6. 1999.