Sciweavers

1120 search results - page 21 / 224
» Eager Markov Chains
Sort
View
GECCO
2004
Springer
15 years 5 months ago
On the Complexity to Approach Optimum Solutions by Inhomogeneous Markov Chains
We analyse the probability 1 − δ to be in an optimum solution after k steps of an inhomogeneous Markov chain which is specified by a logarithmic cooling schedule c(k) = Γ/ ln ...
Andreas Alexander Albrecht
WSC
1997
15 years 1 months ago
A New Variance-Reduction Technique for Regenerative Simulations of Markov Chains
We propose a new estimator for some performance measures obtained from a regenerative simulation of a discrete-time Markov chain. Our new estimator is based on the idea of generat...
James M. Calvin, Marvin K. Nakayama
SAC
2012
ACM
13 years 7 months ago
Decrypting classical cipher text using Markov chain Monte Carlo
In this paper, we present the use of Markov Chain Monte Carlo (MCMC) methods to attack the classical ciphers. We use frequency analysis as our basic tool. First we investigate the...
Jian Chen, Jeffrey S. Rosenthal
SIAMSC
2008
148views more  SIAMSC 2008»
14 years 11 months ago
Multilevel Adaptive Aggregation for Markov Chains, with Application to Web Ranking
A multilevel adaptive aggregation method for calculating the stationary probability vector of an irreducible stochastic matrix is described. The method is a special case of the ada...
Hans De Sterck, Thomas A. Manteuffel, Stephen F. M...
CAV
2007
Springer
113views Hardware» more  CAV 2007»
15 years 6 months ago
Three-Valued Abstraction for Continuous-Time Markov Chains
lued Abstraction for Continuous-Time Markov Chains⋆ Joost-Pieter Katoen1 , Daniel Klink1 , Martin Leucker2 , and Verena Wolf3 RWTH Aachen University1 , TU Munich2 , University of...
Joost-Pieter Katoen, Daniel Klink, Martin Leucker,...