Nalazite se na CroRIS probnoj okolini. Ovdje evidentirani podaci neće biti pohranjeni u Informacijskom sustavu znanosti RH. Ako je ovo greška, CroRIS produkcijskoj okolini moguće je pristupi putem poveznice www.croris.hr
izvor podataka: crosbi

Work Function Algorithm with a Moving Window for Solving the On-line k-server Problem (CROSBI ID 136418)

Prilog u časopisu | izvorni znanstveni rad

Baumgartner, Alfonzo ; Manger, Robert ; Hocenski, Željko Work Function Algorithm with a Moving Window for Solving the On-line k-server Problem // CIT. Journal of computing and information technology, 15 (2007), 4; 325-330

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; k-server problem; work function algorithm (WFA); moving windows; experiments

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

Podaci o izdanju

15 (4)

2007.

325-330

objavljeno

1330-1136

Povezanost rada

Računarstvo, Matematika