hrcak mascot   Srce   HID

Izvorni znanstveni članak
https://doi.org/10.2498/cit.1001140

Work Function Algorithm with a Moving Window for Solving the On-line k-server Problem

Alfonzo Baumgartner
Željko Hocenski
Robert Manger

Puni tekst: engleski, pdf (286 KB) str. 325-330 preuzimanja: 371* citiraj
APA 6th Edition
Baumgartner, A., Hocenski, Ž. i Manger, R. (2007). Work Function Algorithm with a Moving Window for Solving the On-line k-server Problem. Journal of computing and information technology, 15 (4), 325-330. https://doi.org/10.2498/cit.1001140
MLA 8th Edition
Baumgartner, Alfonzo, et al. "Work Function Algorithm with a Moving Window for Solving the On-line k-server Problem." Journal of computing and information technology, vol. 15, br. 4, 2007, str. 325-330. https://doi.org/10.2498/cit.1001140. Citirano 22.07.2019.
Chicago 17th Edition
Baumgartner, Alfonzo, Željko Hocenski i Robert Manger. "Work Function Algorithm with a Moving Window for Solving the On-line k-server Problem." Journal of computing and information technology 15, br. 4 (2007): 325-330. https://doi.org/10.2498/cit.1001140
Harvard
Baumgartner, A., Hocenski, Ž., i Manger, R. (2007). 'Work Function Algorithm with a Moving Window for Solving the On-line k-server Problem', Journal of computing and information technology, 15(4), str. 325-330. https://doi.org/10.2498/cit.1001140
Vancouver
Baumgartner A, Hocenski Ž, Manger R. Work Function Algorithm with a Moving Window for Solving the On-line k-server Problem. Journal of computing and information technology [Internet]. 2007 [pristupljeno 22.07.2019.];15(4):325-330. https://doi.org/10.2498/cit.1001140
IEEE
A. Baumgartner, Ž. Hocenski i R. Manger, "Work Function Algorithm with a Moving Window for Solving the On-line k-server Problem", Journal of computing and information technology, vol.15, br. 4, str. 325-330, 2007. [Online]. https://doi.org/10.2498/cit.1001140

Sažetak
We consider a modification of the well known work function algorithm (WFA) for solving the on-line kserver problem. Our modified WFA is based on a moving window, i. e. on the approximate work function that takes into account only a fixed number of most recent on-line requests. The main motivation for using a moving window is to gain control over the prohibitive computational complexity imposed by the original algorithm. Experimental results are presented, where the performance of the modified WFA has been compared vs. the original WFA.

Hrčak ID: 44613

URI
https://hrcak.srce.hr/44613

Posjeta: 480 *