Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Software
Reference30 articles.
1. Anderson, E.J., & Potts, C.N. (2004). Online scheduling of a single machine to minimize total weighted completion time. Mathematics of Operations Research, 29(3), 686–697.
2. Arpaci-Dusseau, R.H., & Arpaci-Dusseau, A.C. (2014). Operating systems: three easy pieces, chap. Scheduling: Introduction. Arpaci-Dusseau Books.
3. Bartz-Beielstein, T., & Markon, S. (2004). Tuning search algorithms for real-world applications: a regression tree based approach. In Congress on evolutionary computation, 2004. CEC2004, (Vol. 1 pp. 1111–1118). IEEE.
4. Breiman, L. (2001). Random forests. Machine Learning, 45(1), 5–32.
5. Chan, W.T., Chin, F.Y., Ye, D., Zhang, G., Zhang, Y. (2008). On-line scheduling of parallel jobs on two machines. Journal of Discrete Algorithms, 6(1), 3–10.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献