2005 search results - page 64 / 401 » Decisive Markov Chains |
117
click to vote
SIGMETRICS
2002
ACM
15 years 1 months ago
2002
ACM
We introduce a new methodology for the exact analysis of M/G/1-type Markov processes. The methodology uses basic, well-known results for Markov chains by exploiting the structure ...
FCT
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. We analyse the mixing time of Markov chains using path coupling with stopping times. We apply this approach to two hypergraph problems. We show that the Glauber dynamics ...
121
click to vote
GECCO
2005
Springer
15 years 6 months ago
2005
Springer
We analyse the convergence of a GA when the mutation probability is low and the selection pressure is high, for arbitrary crossover types and probabilities. We succeed in mathemat...
ECAI
2004
Springer
15 years 6 months ago
2004
Springer
We present algorithms for the generation of uniformly distributed Bayesian networks with constraints on induced width. The algorithms use ergodic Markov chains to generate samples....