86 search results - page 2 / 18 » Equivalence of Labeled Markov Chains |
DSN
2004
IEEE
13 years 9 months ago
2004
IEEE
In this paper we introduce the logic asCSL, an extension of continuous stochastic logic (CSL), which provides powerful means to characterise execution paths of action- and state-l...
TGC
2010
Springer
13 years 3 months ago
2010
Springer
Rate transition systems (RTS) are a special kind of transition systems introduced for defining the stochastic behavior of processes and for associating continuous-time Markov chain...
COMBINATORICS
2000
13 years 5 months ago
2000
This note extends a recent result of Kannan, Tetali and Vempala to completely solve, via a simple proof, the problem of random generation of a labeled tournament with a given scor...
WSC
1998
13 years 6 months ago
1998
We consider a new simulation-based optimization method called the Nested Partitions (NP) method. This method generates a Markov chain and solving the optimization problem is equiv...
ICPR
2010
IEEE
14 years 9 days ago
2010
IEEE
Many vision applications have been formulated as Markov Random Field (MRF) problems. Although many of them are discrete labeling problems, continuous formulation often achieves gre...