Tài liệu tham khảo |
Loại |
Chi tiết |
[2]. A.R.Calderbank, E.G.Coffman, Jr, Andl.Flatto (1985), Sequencing problems in two-server systems, Math. Oper. Res. 10, No. 4, 585-598 |
Sách, tạp chí |
Tiêu đề: |
Sequencing problems in two-server systems |
Tác giả: |
A.R.Calderbank, E.G.Coffman, Jr, Andl.Flatto |
Năm: |
1985 |
|
[3]. A.R.Calderbank, E.G.Coffman, Jr And L.Flatto (1985),Sequencing two servers on a sphere, Commun. Statist.-Stochastic Models 1, No. 1 (1985), 17-28 |
Sách, tạp chí |
Tiêu đề: |
Sequencing two servers on a sphere |
Tác giả: |
A.R.Calderbank, E.G.Coffman, Jr And L.Flatto (1985),Sequencing two servers on a sphere, Commun. Statist.-Stochastic Models 1, No. 1 |
Năm: |
1985 |
|
[4]. Bartal Y, Grove E (2000), The harmonic k-server algorithm is competitive, JACM |
Sách, tạp chí |
Tiêu đề: |
The harmonic k-server algorithm is competitive |
Tác giả: |
Bartal Y, Grove E |
Năm: |
2000 |
|
[5]. Baumgartner A, Rudec T,Manger R (2010), The design and analysis of a modifiedwork function algorithm for solving the on-line k-server problem, Computing and Informatics29:681–700. 03 |
Sách, tạp chí |
Tiêu đề: |
The design and analysis of a modifiedwork function algorithm for solving the on-line k-server problem |
Tác giả: |
Baumgartner A, Rudec T,Manger R |
Năm: |
2010 |
|
[6]. Bartal Y, Koutsoupias E (2004), On the competitive ratio of the work function algorithm for the k-server problem, Theoretical Computer Science 324:337–345. 02 |
Sách, tạp chí |
Tiêu đề: |
On the competitive ratio of the work function algorithm for the k-server problem |
Tác giả: |
Bartal Y, Koutsoupias E |
Năm: |
2004 |
|
[7]. D. D. Sleator and R. E. Tarjan,Amortized eciency of list update and paging rules, Commun. ACM, 28(2):202{208, 1985} |
Sách, tạp chí |
Tiêu đề: |
Amortized eciency of list update and paging rules |
|
[8]. E.Koutsoupias, C. Papadimitrou, On the k-server conjecture, in: Proceedingsof the 26-th Annual ACM Symposium on Theory of Computing, Montreal, Quebec, Canada, May 23-25, 1994 , (F.T.Leighton, M. Goodrich, Eds.), ACM Press, 1994, 507-511 |
Sách, tạp chí |
Tiêu đề: |
On the k-server conjecture |
|
[9]. Koutsoupias E, Papadimitrou C (1996), The 2-evader problem, Inf Process Lett 57:249–252 |
Sách, tạp chí |
Tiêu đề: |
The 2-evader problem |
Tác giả: |
Koutsoupias E, Papadimitrou C |
Năm: |
1996 |
|
[10]. Lucas Bang (2013), An online algorithm for the 2 server problem on the line with improved competitiveness, Master of Science Degree in Computer Science, University of Nevada, Las Vegas |
Sách, tạp chí |
Tiêu đề: |
An online algorithm for the 2 server problem on the line with improved competitiveness |
Tác giả: |
Lucas Bang |
Năm: |
2013 |
|
[13]. Manasse M, McGeoch LA, Sleator D (1990), Competitive algorithms for server problems, J Algorithms 11:208–230 |
Sách, tạp chí |
Tiêu đề: |
Competitive algorithms for server problems |
Tác giả: |
Manasse M, McGeoch LA, Sleator D |
Năm: |
1990 |
|
[15]. P. Raghavan and M. (1988), Memory versus randomization in on-line algorithms, in“Automata, Languages, and Programming, Lecture Notes in Computer Science,” Vol. 372pp. 687-703, Springer-Verlag, New York |
Sách, tạp chí |
Tiêu đề: |
Memory versus randomization in on-line algorithms", in“Automata, Languages, and Programming, Lecture Notes in Computer Science |
Tác giả: |
P. Raghavan and M |
Năm: |
1988 |
|
[16]. Tomislav Rudec and Robert Manger, A fast approximate implementation of the work funtion algorithm for solving the k-server problem, Journal: Central European Journal of Operations Research, 2015, Volume 23, Number 3, Page 699. 01 |
Sách, tạp chí |
Tiêu đề: |
A fast approximate implementation of the work funtion algorithm for solving the k-server problem |
|
[17]. Susanne Albers (2003), Online Algorithms,Mathematical Programing, Volume 97, Issue 1, pp 3-26 |
Sách, tạp chí |
Tiêu đề: |
Online Algorithms |
Tác giả: |
Susanne Albers |
Năm: |
2003 |
|
[1]. Trần Tuấn Minh (2002), Giáo trình Thiết kế và đánh giá thuật toán, Đại học Đà Lạt.Tài liệu tiếng Anh |
Khác |
|
[11]. Gardner, M., 1960a. Mathematical games. Scientific American 202 (1), 150–156 |
Khác |
|
[12]. Gardner, M., 1960b. Mathematical games. Scientific American 202 (3), 172–182 |
Khác |
|
[14]. M. Queyranne(2002), An Introduction to Competitive Analysis for Online Optimization |
Khác |
|