82 search results - page 1 / 17 » Reasoning about online algorithms with weighted automata |
TALG
2010
13 years 3 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...
ATVA
2011
Springer
12 years 4 months ago
2011
Springer
In [AKL10], we showed how viewing online algorithms as reactive systems enables the application of ideas from formal verification to the competitive analysis of online algorithms....
ECCC
2010
13 years 4 months ago
2010
Suppose a decision maker has to purchase a commodity over time with varying prices and demands. In particular, the price per unit might depend on the amount purchased and this pri...
CONCUR
2012
Springer
11 years 7 months ago
2012
Springer
Simulation and Abstraction Guy Avni and Orna Kupferman School of Computer Science and Engineering, Hebrew University, Israel Weighted automata map input words to real numbers and a...
NAACL
2003
13 years 6 months ago
2003
Previous work on minimizing weighted finite-state automata (including transducers) is limited to particular types of weights. We present efficient new minimization algorithms th...