Should evolutionary geneticists worry about higher-order epistasis?
Natural selection drives evolving populations up the fitness landscape, the projection from
nucleotide sequence space to organismal reproductive success. While it has long been …
nucleotide sequence space to organismal reproductive success. While it has long been …
An introduction and survey of estimation of distribution algorithms
M Hauschild, M Pelikan - Swarm and evolutionary computation, 2011 - Elsevier
Estimation of distribution algorithms (EDAs) are stochastic optimization techniques that
explore the space of potential solutions by building and sampling explicit probabilistic …
explore the space of potential solutions by building and sampling explicit probabilistic …
Genetic algorithms
K Sastry, D Goldberg, G Kendall - Search methodologies: Introductory …, 2005 - Springer
Chapter 4 GENETIC ALGORITHMS Page 1 Chapter 4 GENETIC ALGORITHMS Kumara Sastry,
David Goldberg University of Illinois, USA Graham Kendall University of Nottingham, UK 4.1 …
David Goldberg University of Illinois, USA Graham Kendall University of Nottingham, UK 4.1 …
[PDF][PDF] A survey of linkage learning techniques in genetic and evolutionary algorithms
This paper reviews and summarizes existing linkage learning techniques for genetic and
evolutionary algorithms in the literature. It first introduces the definition of linkage in both …
evolutionary algorithms in the literature. It first introduces the definition of linkage in both …
The influence of higher-order epistasis on biological fitness landscape topography
DM Weinreich, Y Lan, J Jaffe… - Journal of statistical …, 2018 - Springer
The effect of a mutation on the organism often depends on what other mutations are already
present in its genome. Geneticists refer to such mutational interactions as epistasis. Pairwise …
present in its genome. Geneticists refer to such mutational interactions as epistasis. Pairwise …
Optimal query complexity bounds for finding graphs
SS Choi, JH Kim - Proceedings of the fortieth annual ACM symposium on …, 2008 - dl.acm.org
We consider the problem of finding an unknown graph by using two types of queries with an
additive property. Given a graph, an additive query asks the number of edges in a set of …
additive property. Given a graph, an additive query asks the number of edges in a set of …
Iterated Local Search with Linkage Learning
In pseudo-Boolean optimization, a variable interaction graph represents variables as
vertices, and interactions between pairs of variables as edges. In black-box optimization, the …
vertices, and interactions between pairs of variables as edges. In black-box optimization, the …
DEUM: a framework for an estimation of distribution algorithm based on Markov random fields.
SK Shakya - 2006 - rgu-repository.worktribe.com
Estimation of Distribution Algorithms (EDAs) belong to the class of population based
optimisation algorithms. They are motivated by the idea of discovering and exploiting the …
optimisation algorithms. They are motivated by the idea of discovering and exploiting the …
A multi-objective window optimisation problem
We present an optimisation problem which seeks to locate the Pareto-optimal front of
building window and shading designs minimising two objectives: projected energy use of …
building window and shading designs minimising two objectives: projected energy use of …
A novel approach to designing surrogate-assisted genetic algorithms by combining efficient learning of Walsh coefficients and dependencies
Surrogate-assisted evolutionary algorithms have the potential to be of high value for real-
world optimization problems when fitness evaluations are expensive, limiting the number of …
world optimization problems when fitness evaluations are expensive, limiting the number of …