Recombination operators and selection strategies for evolutionary Markov chain Monte Carlo algorithms
DOI10.1007/S12065-010-0040-1zbMATH Open1214.68282DBLPjournals/evi/DruganT10OpenAlexW1988382099WikidataQ41731122 ScholiaQ41731122MaRDI QIDQ613018FDOQ613018
Authors: Madalina M. Drugan, Dirk Thierens
Publication date: 17 December 2010
Published in: Evolutionary Intelligence (Search for Journal in Brave)
Full work available at URL: http://europepmc.org/articles/pmc2987561
Recommendations
Monte Carlo methods (65C05) Numerical analysis or methods applied to Markov chains (65C40) Learning and adaptive systems in artificial intelligence (68T05)
Cites Work
- Sequential Monte Carlo Methods in Practice
- Optimization by simulated annealing
- Weak convergence and optimal scaling of random walk Metropolis algorithms
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- Title not available (Why is that?)
- Approximating discrete probability distributions with dependence trees
- Monte Carlo sampling methods using Markov chains and their applications
- An introduction to MCMC for machine learning
- A survey of optimization by building and using probabilistic models
- Population Markov chain Monte Carlo
- Parallel recombinative simulated annealing: A genetic algorithm
- A new connection between quantum circuits, graphs and the Ising partition function
- Title not available (Why is that?)
- Artificial Evolution
- Parallel and interacting Markov chain Monte Carlo algorithm
Cited In (4)
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)