352 search results - page 13 / 71 » On the optimal reachability problem of weighted timed automa... |
SAT
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. In this paper we study NP-hard weighted satisfiability optimization problems for the class 2-CNF providing worst-case upper time bounds. Moreover we consider the monoton...
MCSS
2006
Springer
13 years 7 months ago
2006
Springer
Abstract Limited capacity of communication channels has brought to the attention of many researchers the analysis of control systems subject to a quantized input set. In some funda...
FCT
2007
Springer
13 years 11 months ago
2007
Springer
We investigate issues regarding two hard problems related to voting, the optimal weighted lobbying problem and the winner problem for Dodgson elections. Regarding the former, Chris...
CAV
2010
Springer
13 years 11 months ago
2010
Springer
Often one has a preference order among the different systems that satisfy a given specification. Under a probabilistic assumption about the possible inputs, such a preference order...
CONCUR
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Quantitative languages are an extension of boolean languages that assign to each word a real number. Mean-payoff automata are finite automata with numerical weights on tr...