352 search results - page 18 / 71 » On the optimal reachability problem of weighted timed automa... |
MOR
2000
13 years 7 months ago
2000
We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to minimize the weighted sum of job completion times. This problem is NP-hard in the s...
TACAS
2010
Springer
14 years 2 months ago
2010
Springer
We study the model checking problem of timed automata based on SAT solving. Our work investigates alternative possibilities for coding the SAT reductions that are based on parallel...
ICCAD
2009
IEEE
13 years 5 months ago
2009
IEEE
We present a rigorous framework that defines a class of net weighting schemes in which unconstrained minimization is successively performed on a weighted objective. We show that, ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Two-player zero-sum games are a well-established model for synthesising controllers that optimise some performance criterion. In such games one player represents the cont...
CPM
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. The efficiency of regular expression matching algorithms depends very much on the size of the nondeterministic finite automata (NFA) obtained from regular expressions. R...