Author:
Ye Deshi,Chen Danny Z.,Zhang Guochuan
Funder
National Natural Science Foundation of China
China Scholarship Council
National Science Foundation
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Management Science and Operations Research,General Engineering,Software
Reference25 articles.
1. Aspnes, J., Azar, Y., Fiat, A., Plotkin, S., & Waarts, O. (1997). On-line routing of virtual circuits with applications to load balancing and machine scheduling. Journal of the ACM, 44(3), 486–504.
2. Baker, B., & Schwartz, J. (1983). Shelf algorithms for two-dimensional packing problems. SIAM Journal on Computing, 12, 508–525.
3. Belkhale, K., & Banerjee, P. (1990). Approximate algorithms for the partitionable independent task scheduling problem. In Proceedings of the international conference on parallel processing (ICPP) (pp. 72–75).
4. Borodin, A., & El-Yaniv, R. (1998). Online computation and competitive analysis. Cambridge: Cambridge University Press.
5. Cirne, W., & Berman, F. (2001). A model for moldable supercomputer jobs. In Proceedings of the 15th international parallel and distributed processing symposium (IPDPS) (pp. 59–66).
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献