352 search results - page 12 / 71 » On the optimal reachability problem of weighted timed automa... |
HYBRID
1999
Springer
13 years 12 months ago
1999
Springer
In this work we tackle the following problem: given a timed automaton, and a target set F of configurations, restrict its transition relation in a systematic way so that from ever...
TALG
2010
13 years 6 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...
AIPS
2010
13 years 10 months ago
2010
Factored planning methods aim to exploit locality to efficiently solve large but "loosely coupled" planning problems by computing solutions locally and propagating limit...
CAV
2001
Springer
14 years 5 days ago
2001
Springer
In this paper we show how the classical job-shop scheduling problem can be modeled as a special class of acyclic timed automata. Finding an optimal schedule corresponds, then, to n...
FSTTCS
2005
Springer
14 years 1 months ago
2005
Springer
We introduce asynchronous dynamic pushdown networks (ADPN), a new model for multithreaded programs in which pushdown systems communicate via shared memory. ADPN generalizes both CP...