crta
Hrvatska znanstvena Sekcija img
bibliografija
3 gif
 Naslovna
 O projektu
 FAQ
 Kontakt
4 gif
Pregledavanje radova
Jednostavno pretraživanje
Napredno pretraživanje
Skupni podaci
Upis novih radova
Upute
Ispravci prijavljenih radova
Ostale bibliografije
Slični projekti
 Bibliografske baze podataka

Pregled bibliografske jedinice broj: 321479

Časopis

Autori: Baumgartner, Alfonzo; Manger, Robert; Hocenski, Željko
Naslov: Work Function Algorithm with a Moving Window for Solving the On-line k-server Problem
Izvornik: Journal of Computing and Information Technology - CIT (1330-1136) 15 (2007), 4; 325-330
Vrsta rada: članak
Ključne riječi: on-line problems; on-line algorithms; k-server problem; work function algorithm (WFA); moving windows; experiments
Sažetak:
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.
Projekt / tema: 165-0361621-2000, 037-0362980-2774
Izvorni jezik: ENG
Kategorija: Znanstveni
Znanstvena područja:
Matematika,Računarstvo
URL cjelovitog teksta:
Google Scholar: Work Function Algorithm with a Moving Window for Solving the On-line k-server Problem
Upisao u CROSBI: Robert Manger (manger@math.hr), 11. Vel. 2008. u 12:45 sati



  Verzija za printanje   za tiskati


upomoc
foot_4