Scholarlink

Online algorithms are widely used in many application domains due to the intrinsic online nature of many algorithmic problems, and competitive analysis is a theoretical framework that measures the quality of online algorithms. We present a simplified proof of bounded competitive ratios for the family of move-toward-front temporal-locality algorithmic heuristics.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

On Online Self-Organizing Linear Search

  • 会议论文

  • 发表日期：

    2026年

查看全文
  • H. K. Dai,
  • H. C. Su,
  • D. Ying

摘要

Online algorithms are widely used in many application domains due to the intrinsic online nature of many algorithmic problems, and competitive analysis is a theoretical framework that measures the quality of online algorithms. We present a simplified proof of bounded competitive ratios for the family of move-toward-front temporal-locality algorithmic heuristics.