Results 261 to 270 of about 2,925,749 (309)
Some of the next articles are maybe not open access.
Annals of Mathematics and Artificial Intelligence, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Monte Carlo Sampling Methods Using Markov Chains and Their Applications
, 1970W. Hastings
semanticscholar +1 more source
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2003
We propose a model called a pairwise Markov chain (PMC), which generalizes the classical hidden Markov chain (HMC) model. The generalization, which allows one to model more complex situations, in particular implies that in PMC the hidden process is not necessarily a Markov process.
openaire +1 more source
We propose a model called a pairwise Markov chain (PMC), which generalizes the classical hidden Markov chain (HMC) model. The generalization, which allows one to model more complex situations, in particular implies that in PMC the hidden process is not necessarily a Markov process.
openaire +1 more source
On a ψ-Mixing property for Entangled Markov Chains
Physica A: Statistical Mechanics and Its Applications, 2023Abdessatar Souissi
exaly
IEEE Transactions on Electronic Computers, 1963
Jack Sklansky, Kenneth R. Kaplan
openaire +2 more sources
Jack Sklansky, Kenneth R. Kaplan
openaire +2 more sources
Markov Chains and Monte Carlo Markov Chains
2013The theory of Markov chains is rooted in the work of Russian mathematician Andrey Markov, and has an extensive body of literature to establish its mathematical foundations. The availability of computing resources has recently made it possible to use Markov chains to analyze a variety of scientific data, and Monte Carlo Markov chains are now one of the ...
openaire +1 more source
When a Markov chain models nature or social interactions, it is likely not followed exactly, but only approximately. We therefore introduce several notions of robustness for a Markov chain P. Our standard adversary can dynamically change transition probabilities of P by 1 ± ε, and our strong adversary can completely control each transition ...
openaire +2 more sources
openaire +2 more sources

