列表分解和相对最差阶分析
List Factoring and Relative Worst Order Analysis
摘要:
相对最差阶分析是竞争分析的一种补充或替代方法,它已被证明可以为一系列不同的在线问题提供更符合在线算法观察行为的结果。本文的贡献是双重的。首先,它增加了静态列表访问问题的在线问题的集合中,相对最坏的顺序分析给出了更好的结果。其次,也许更有趣的是,它将列表分解的非平凡补充证明技术添加到相对最差阶分析的理论工具箱中。
英文摘要:
Relative worst order analysis is a supplement or alternative to competitive analysis which has been shown to give results more in accordance with observed behavior of online algorithms for a range of different online problems. The contribution of this paper is twofold. First, it adds the static list accessing problem to the collection of online problems where relative worst order analysis gives better results. Second, and maybe more interesting, it adds the non-trivial supplementary proof technique of list factoring to the theoretical toolbox for relative worst order analysis.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。