Correlated and uncorrelated fitness landscapes and how to tell the difference

DOI10.1007/BF00202749zbMATH Open0703.92016WikidataQ55967974 ScholiaQ55967974MaRDI QIDQ916592FDOQ916592

Authors: Edward D. Weinberger 

Publication date: 1990

Published in: Biological Cybernetics (Search for Journal in Brave)

Recommendations

• Percolation on fitness landscapes: effects of correlation, phenotype, and incompatibilities
• On the use of random walks to estimate correlation in fitness landscapes.
• Measuring epistasis in fitness landscapes: the correlation of fitness effects of mutations
• Fitness landscapes and the Andrews-Curtis conjecture
• Estimating some features of \(NK\) fitness landscapes.

zbMATH Keywords

random walkfitness landscapesautocorrelation of fitnessesaverage autocorrelationcombinatorial optimization algorithmsglobally optimal fitnesses of AR(1) landscapes

Mathematics Subject Classification ID

Time series, auto-correlation, regression, etc. in statistics (GARCH) (62M10) Problems related to evolution (92D15)

Cites Work

• Optimization by simulated annealing
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Noetherian modules and Noetherian injective rings
• Title not available (Why is that?)
• Erratum To " ∗ -Valuations and Ordered ∗ -Fields"

Cited In (63)

• A review of distances for the Mallows and generalized Mallows estimation of distribution algorithms
• Fitness landscapes and the Andrews-Curtis conjecture
• ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms
• The linear ordering problem: instances, search space analysis and algorithms
• Designing Efficient Evolutionary Algorithms for Cluster Optimization: A Study on Locality
• On the roles of semantic locality of crossover in genetic programming
• Algorithm runtime prediction: methods \& evaluation
• The landscape of the traveling salesman problem
• Penalty and partitioning techniques to improve performance of QUBO solvers
• Complex networks: from graph theory to biology
• Dynamics of local search trajectory in traveling salesman problem
• Autocorrelation measures for the quadratic assignment problem
• On the landscape ruggedness of the quadratic assignment problem
• The parameter-less genetic algorithm in practice
• Local search with memory: Benchmarking RTS
• Optimal execution with non-linear transient market impact
• In and out forests on combinatorial landscapes
• Exact computation of the fitness-distance correlation for pseudoboolean functions with one global optimum
• On the classification of NP-complete problems in terms of their correlation coefficient
• On the Hamming distance in combinatorial optimization problems on hypergraph matchings
• Quantitative measure of nonconvexity for black-box continuous functions
• Autocorrelation coefficient for the graph bipartitioning problem
• Combinatorial vector fields and the valley structure of fitness landscapes
• The characteristic landscape equation for an AR(2) landscape
• A review of metrics on permutations for search landscape analysis
• Optimization by hierarchical mutant production
• Random assignment problems
• Breaking the search space symmetry in partitioning problems: an application to the graph coloring problem
• Why operator-induced neighborhoods are a bad idea
• \(\mathrm{PUBO}_i\): a tunable benchmark with variable importance
• Fitness landscape of the cellular automata majority problem: view from the ``Olympus
• A new adaptive multi-start technique for combinatorial global optimizations
• Landscapes and their correlation functions
• Random walk's correlation function for multi-objective NK landscapes and quadratic assignment problem
• Combinatorial landscapes
• Evolutionary accessibility in tunably rugged fitness landscapes
• A region-based multi-issue negotiation protocol for nonmonotonic utility spaces
• A Gaussian random field model of smooth fitness landscapes
• Neutrality in fitness landscapes.
• Landscapes on spaces of trees
• From fitness landscapes evolution to automatic local search algorithm generation
• Title not available (Why is that?)
• A minimum on the mean number of steps taken in adaptive walks
• Elementary landscape decomposition of the frequency assignment problem
• A complex-networks view of hard combinatorial search spaces
• Mutation landscapes
• Fitness landscape analysis and metaheuristics efficiency
• On the use of random walks to estimate correlation in fitness landscapes.
• Iterated local search for the quadratic assignment problem
• Arbitrary elementary landscapes \& AR(1) processes
• Exact results for amplitude spectra of fitness landscapes
• Hill climbing algorithms and Trivium
• Landscape statistics of the low-autocorrelation binary string problem
• Coupled map lattices as spatio-temporal fitness functions: Landscape measures and evolutionary optimization
• Estimating some features of \(NK\) fitness landscapes.
• Random walks and orthogonal functions associated with highly symmetric graphs
• On the foundations and the applications of evolutionary computing
• Fourier and Taylor series on fitness landscapes
• Stochastic local search and parameters recommendation: a case study on flowshop problems
• Partial neighborhood local searches
• Artificial Evolution
• Rugged and elementary landscapes
• On the usefulness of accessibility graphs with combinatorial optimization problems

This page was built for publication: Correlated and uncorrelated fitness landscapes and how to tell the difference

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q916592)