Author:
Chin Francis Y. L.,Fung Stanley P. Y.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference15 articles.
1. A. V. Aho, J. E. Hopcroft and J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
2. S. Baruah, G. Koren, D. Mao, B. Mishra, A. Raghunathan, L. Rosier, D. Shasha and F. Wang, On the Competitiveness of On-Line Real-Time Task Scheduling, Real-Time Systems, 4 (1992), 125–144.
3. J. L. Bentley and A. C.-C. Yao, An Almost Optimal Algorithm for Unbounded Searching, Information Processing Letters, 5(3) (1976), 82–87.
4. A. Borodin and R. El-Yaniv, Online Computation and Competitive Analysis, Cambridge University Press, New York, 1998.
5. E. Chang and C. Yap, Competitive Online Scheduling with Level of Service, Proceedings of the 7th Annual International Computing and Combinatorics Conference, pp. 453–462, 2001.
Cited by
62 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献