4007 search results - page 242 / 802 » Computation with imprecise probabilities |
138
click to vote
IPL
2007
15 years 4 months ago
2007
We show that the problem of reaching a state set with probability 1 in probabilisticnondeterministic systems operating in parallel is EXPTIME-complete. We then show that this prob...
102
click to vote
TSMC
2002
15 years 4 months ago
2002
An extended algorithm of the relative reward strength algorithm is proposed. It is shown that the proposed algorithm ensures the convergence with probability 1 to the optimal path ...
158
click to vote
IFM
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision ...
155
click to vote
TIT
2008
15 years 2 months ago
2008
We introduce a new state discrimination problem in which we are given additional information about the state after the measurement, or more generally, after a quantum memory bound ...
149
click to vote
INFOCOM
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract--We study replication mechanisms that include ReedSolomon type codes as well as network coding in order to improve the probability of successful delivery within a given ti...