9051 search results - page 202 / 1811 » On detectability of stochastic systems |
174
Voted
COCO
2003
Springer
16 years 10 days ago
2003
Springer
A fruitful connection between algorithm design and proof complexity is the formalization of the ¤¦¥¨§©§ approach to satisfiability testing in terms of tree-like resolution...
205
click to vote
TSP
2008
15 years 7 months ago
2008
A novel method for the estimation of a finite part of the impulse response is presented. The method is consistent in case the measured output data are prone to colored noise. The c...
193
click to vote
IFM
2010
Springer
2010
Springer
Satisfaction Meets Expectations - Computing Expected Values of Probabilistic Hybrid Systems with SMT
15 years 5 months ago
Stochastic satisfiability modulo theories (SSMT), which is an extension of satisfiability modulo theories with randomized quantification, has successfully been used as a symboli...
219
click to vote
TFS
2011
15 years 2 months ago
2011
—Reinforcement learning (RL) is a valuable learning method when the systems require a selection of control actions whose consequences emerge over long periods for which input– ...
228
Voted
CAV
2012
Springer
13 years 9 months ago
2012
Springer
Real-life systems are usually hard to control, due to their complicated structures, quantitative time factors and even stochastic behaviors. In this work, we present a model checke...