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 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 fo...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of computing and information technology Ročník 15; číslo 4; s. 325 - 330
Hlavní autori:	Baumgartner, Alfonzo, Manger, Robert, Hocenski, eljko
Médium:	Journal Article Konferenčný príspevok.. Paper
Jazyk:	English
Vydavateľské údaje:	Zagreb University Computing Centre 01.12.2007 Sveuciliste U Zagrebu Fakultet elektrotehnike i računarstva Sveučilišta u Zagrebu
Predmet:	Algorithms Analysis Applied sciences Computer science; control theory; systems Computer systems and distributed systems. User interface Exact sciences and technology Software United States K server problem Work function Motivation experiments on-line algorithms Windows Distributed system moving windows on-line problems Computational complexity work function algorithm (WFA) k- server problem
ISSN:	1330-1136, 1846-3908
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!