Affiliation:
1. Hebrew University, Jerusalem, Israel
Abstract
We describe an automata-theoretic approach for the competitive analysis of
online algorithms
. Our approach is based on
weighted automata
, which assign to each input word a cost in R
≥0
. By relating the “unbounded look ahead” of optimal offline algorithms with nondeterminism, and relating the “no look ahead” of online algorithms with determinism, we are able to solve problems about the competitive ratio of online algorithms, and the memory they require, by reducing them to questions about
determinization
and
approximated determinization
of weighted automata.
Publisher
Association for Computing Machinery (ACM)
Subject
Mathematics (miscellaneous)
Cited by
26 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献