MN-EDA and the Use of Clique-Based Factorisations in EDAs
From MaRDI portal
Publication:4649191
DOI10.1007/978-3-642-28900-2_5zbMath1251.68217OpenAlexW2184402799MaRDI QIDQ4649191
Publication date: 20 November 2012
Published in: Adaptation, Learning, and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-28900-2_5
Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Cites Work
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Combining variable neighborhood search and estimation of distribution algorithms in the protein side chain placement problem
- Causation, prediction, and search
- Schemata, distributions and graphical models in evolutionary optimization
- 10.1162/153244301753344605
- Constructing Free-Energy Approximations and Generalized Belief Propagation Algorithms
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- Fast Fitness Improvements in Estimation of Distribution Algorithms Using Belief Propagation
- Algorithm 457: finding all cliques of an undirected graph
- A Theory of Cooperative Phenomena
This page was built for publication: MN-EDA and the Use of Clique-Based Factorisations in EDAs
