Work Function Algorithm with a Moving Window for Solving the On-line k-server Problem

CIT. Journal of Computing and Information Technology

Hocenski, Željko¹  Manger, Robert¹  Baumgartner, Alfonzo¹ 

DOI  :  

学科分类：计算机科学（综合）

来源: Sveuciliste u Zagrebu

【 摘 要 】

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

【 授权许可】

Unknown