首页    期刊浏览 2025年01月10日 星期五
登录注册

文章基本信息

  • 标题:Work Function Algorithm with a Moving Window for Solving the On-line k-server Problem
  • 本地全文:下载
  • 作者:Baumgartner, Alfonzo ; Hocenski, Željko ; Manger, Robert
  • 期刊名称:Journal of Computing and Information Technology
  • 印刷版ISSN:1330-1136
  • 电子版ISSN:1846-3908
  • 出版年度:2007
  • 卷号:15
  • 期号:4
  • 页码:325-330
  • 出版社:SRCE - Sveučilišni računski centar
  • 摘要: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 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.
国家哲学社会科学文献中心版权所有