875 search results - page 36 / 175 » On Reachability Under Uncertainty |
110
click to vote
ESOP
2009
Springer
15 years 4 months ago
2009
Springer
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...
102
Voted
HYBRID
2007
Springer
15 years 6 months ago
2007
Springer
This work investigates some of the computational issues involved in the solution of probabilistic reachability problems for discretetime, controlled stochastic hybrid systems. It i...
104
Voted
NIPS
2007
15 years 2 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...
ICTAC
2009
Springer
14 years 10 months ago
2009
Springer
The GSPeeDI tool implements a decision procedure for the reachability analysis of GSPDIs, planar hybrid systems whose dynamics is given by differential inclusions, and that are not...
90
Voted
CAGD
2008
15 years 24 days ago
2008
A simple proof is provided for the fact that the set of all possible triangulations of a planar point set in a polygonal domain is closed under the basic diagonal flip operation.