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

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Proceedings of the ITI 2007 : 29th International Conference on Information Technology Interfaces : ITI 2007 : June 25-28, 2007, Cavtat/Dubrovnik, Croatia s. 591 - 596
Hlavní autoři:	Baumgartner, A., Manger, R., Hocenski, Z.
Médium:	Konferenční příspěvek
Jazyk:	angličtina
Vydáno:	Zagreb IEEE 01.06.2007 University Computing Centre
Témata:	Algorithmics. Computability. Computer arithmetics Applied sciences Approximation algorithms Computational complexity Computer science; control theory; systems Computer systems and distributed systems. User interface Cost function Decision making Degradation Exact sciences and technology experiments Gain control Information technology Mathematics moving windows on-line algorithms on-line problems Optimized production technology Software the k-server problem the work function algorithm (WFA) Theoretical computing K server problem Computational complexity Distributed system
ISBN:	9537138097, 9789537138097
ISSN:	1330-1012
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!