352 search results - page 9 / 71 » On the optimal reachability problem of weighted timed automa... |
FOSSACS
2009
Springer
13 years 11 months ago
2009
Springer
We study generalized fixed-point equations over idempotent semirings and provide an efficient algorithm for the detection whether a sequence of Kleene's iterations stabilizes ...
NIPS
2007
13 years 9 months ago
2007
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...
FORMATS
2006
Springer
13 years 11 months ago
2006
Springer
Polygonal hybrid systems (SPDI) are a subclass of planar hybrid automata which can be represented by piecewise constant differential inclusions. The reachability problem as well as...
SIAMCO
2010
13 years 2 months ago
2010
We consider a target problem for a nonlinear system under state constraints. We give a new continuous level-set approach for characterizing the optimal times and the backward-reach...
COCOON
2001
Springer
14 years 6 days ago
2001
Springer
We consider generalized discrete timed automata with general linear relations over clocks and parameterized constants as clock constraints and with parameterized durations. We look...