Sciweavers

36 search results - page 5 / 8
» Sensitivity analysis for finite Markov chains in discrete ti...
Sort
View
CORR
2010
Springer
112views Education» more  CORR 2010»
13 years 7 months ago
Efficient Approximation of Optimal Control for Markov Games
The success of probabilistic model checking for discrete-time Markov decision processes and continuous-time Markov chains has led to rich academic and industrial applications. The ...
Markus Rabe, Sven Schewe, Lijun Zhang
AUTOMATICA
2008
134views more  AUTOMATICA 2008»
13 years 7 months ago
Probabilistic reachability and safety for controlled discrete time stochastic hybrid systems
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 ...
Alessandro Abate, Maria Prandini, John Lygeros, Sh...
BIOINFORMATICS
2005
152views more  BIOINFORMATICS 2005»
13 years 7 months ago
Intervention in context-sensitive probabilistic Boolean networks
Motivation: Intervention in a gene regulatory network is used to help it avoid undesirable states, such as those associated with a disease. Several types of intervention have been...
Ranadip Pal, Aniruddha Datta, Michael L. Bittner, ...
EPEW
2008
Springer
13 years 9 months ago
State-Aware Performance Analysis with eXtended Stochastic Probes
We define a mechanism for specifying performance queries which combine instantaneous observations of model states and finite sequences of observations of model activities. We reali...
Allan Clark, Stephen Gilmore
STOC
2009
ACM
118views Algorithms» more  STOC 2009»
14 years 2 months ago
How long does it take to catch a wild kangaroo?
The discrete logarithm problem asks to solve for the exponent x, given the generator g of a cyclic group G and an element h ∈ G such that gx = h. We give the first rigorous pro...
Ravi Montenegro, Prasad Tetali