TALG
2010
13 years 10 months ago
2010
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...
DAGSTUHL
1996
14 years 1 months ago
1996
Abstract. Most applications of competitive analysis have involved online problems where a candidate on-line algorithm must compete on some input sequence against an optimal o -line...
ESA
2004
Springer
14 years 5 months ago
2004
Springer
Abstract. The problem of maximizing the weighted throughput in various switching settings has been intensively studied recently through competitive analysis. To date, the most gene...
ICML
2002
IEEE
15 years 1 months ago
2002
IEEE