122 search results - page 13 / 25 » Weighted automata with discounting |
ACTA
2004
14 years 9 months ago
2004
The generative capability of several variants of P systems with symport/antiport is studied via the simulation of counter automata. This leads to the reduction of the complexity, e...
159
click to vote
FOSSACS
2011
Springer
14 years 1 months ago
2011
Springer
Traditional automata accept or reject their input, and are therefore Boolean. In contrast, weighted automata map each word to a value from a semiring over a large domain. The speci...
SCP
2010
14 years 8 months ago
2010
Several scienti c bottlenecks have been identi ed in existing component-based approaches. em, we focus on the identi cation of a relevant abstraction for the component expression ...
AAAI
2010
14 years 11 months ago
2010
This paper presents a technique for approximating, up to any precision, the set of subgame-perfect equilibria (SPE) in repeated games with discounting. The process starts with a s...
REX
1991
15 years 1 months ago
1991
Abstract. We consider an optimal-reachability problem for a timed automaton with respect to a linear cost function which results in a weighted timed automaton. Our solution to this...