Recombination operators and selection strategies for evolutionary Markov chain Monte Carlo algorithms
From MaRDI portal
(Redirected from Publication:613018)
Recommendations
Cites work
- scientific article; zbMATH DE number 1471711 (Why is no real title available?)
- scientific article; zbMATH DE number 840151 (Why is no real title available?)
- A new connection between quantum circuits, graphs and the Ising partition function
- A survey of optimization by building and using probabilistic models
- An introduction to MCMC for machine learning
- Approximating discrete probability distributions with dependence trees
- Artificial Evolution
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- Monte Carlo sampling methods using Markov chains and their applications
- Optimization by simulated annealing
- Parallel and interacting Markov chain Monte Carlo algorithm
- Parallel recombinative simulated annealing: A genetic algorithm
- Population Markov chain Monte Carlo
- Sequential Monte Carlo Methods in Practice
- Weak convergence and optimal scaling of random walk Metropolis algorithms
Cited in
(5)- Real-Parameter Evolutionary Monte Carlo With Applications to Bayesian Mixture Models
- A parallel evolutionary multiple-try Metropolis Markov chain Monte Carlo algorithm for sampling spatial partitions
- X-TMCMC: adaptive kriging for Bayesian inverse modeling
- scientific article; zbMATH DE number 1471711 (Why is no real title available?)
- Artificial Evolution
This page was built for publication: Recombination operators and selection strategies for evolutionary Markov chain Monte Carlo algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q613018)