952 search results - page 21 / 191 » Computational complexity of stochastic programming problems |
ICFP
2007
ACM
14 years 11 months ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
AAAI
2004
14 years 10 days ago
2004
The search for finite-state controllers for partially observable Markov decision processes (POMDPs) is often based on approaches like gradient ascent, attractive because of their ...
CORR
2008
Springer
13 years 11 months ago
2008
Springer
The behavior of some stochastic chemical reaction networks is largely unaffected by slight inaccuracies in reaction rates. We formalize the robustness of state probabilities to re...
ACSD
2008
IEEE
14 years 5 months ago
2008
IEEE
In recent years it has become clear that techniques developed for concurrent programming are in fact very useful for the analysis of complex systems in biology. To some level of i...
AUTOMATICA
2008
13 years 11 months ago
2008
In this work, probabilistic reachability over a finite horizon is investigated for a class of discrete time stochastic hybrid systems with control inputs. A suitable embedding of ...