Work function algorithm with a moving window for solving the on-line k-server problem (CROSBI ID 528016)
Prilog sa skupa u zborniku | izvorni znanstveni rad | međunarodna recenzija
Podaci o odgovornosti
Baumgartner, Alfonzo ; Manger, Robert ; Hocenski Željko
engleski
Work function algorithm with a moving window for solving the on-line k-server problem
We consider a modification of the well known work function algorithm (WFA) for solving the on-line k-server 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.
on-line problems; on-line algorithms; the k-server problem; the work function algorithm (WFA); moving windows; experiments
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
Podaci o prilogu
507-512-x.
2007.
nije evidentirano
objavljeno
953-7138-10-0
Podaci o matičnoj publikaciji
Proceedings of the 29th International Conference on Information Technology Interfaces (ITI 2007 - Cavtat, Croatia, June 25-28, 2007)
Lužar-Stiffler, Vesna ; Dobić Hljuz, Vesna
Zagreb: Sveučilišni računski centar Sveučilišta u Zagrebu (Srce)
1330-1012
Podaci o skupu
29th International Conference on Information Technology Interfaces (ITI 2007)
predavanje
25.06.2007-28.06.2007
Cavtat, Hrvatska