Computing the moments k-bounded pseudo-Boolean functions over Hamming spheres of arbitrary radius in polynomial time

DOI10.1016/J.TCS.2011.02.006zbMATH Open1237.68195OpenAlexW2135960340MaRDI QIDQ418028FDOQ418028

Authors: Andrew M. Sutton, L. Darrell Whitley, Adele E. Howe 

Publication date: 14 May 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.02.006

Recommendations

• Approximating the distribution of fitness over Hamming regions
• Almost tight upper bound for finding Fourier coefficients of bounded pseudo-Boolean functions
• On the analysis of a simple evolutionary algorithm on quadratic pseudo-Boolean functions
• scientific article; zbMATH DE number 2013513
• scientific article; zbMATH DE number 1696516

zbMATH Keywords

local searchfitness landscape analysispseudo-Boolean functionselementary landscapesWalsh analysis

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Boolean functions (06E30)

Cites Work

• Title not available (Why is that?)
• Combinatorial landscapes
• Stochastic local search. Foundations and applications.
• Landscapes and their correlation functions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Local search and the local structure of NP-complete problems
• Title not available (Why is that?)
• On the landscape ruggedness of the quadratic assignment problem
• Almost tight upper bound for finding Fourier coefficients of bounded pseudo-Boolean functions

Cited In (5)

• Exact computation of the expectation surfaces for uniform crossover along with bit-flip mutation
• The component model for elementary landscapes and partial neighborhoods
• Approximating the distribution of fitness over Hamming regions
• Random walk's correlation function for multi-objective NK landscapes and quadratic assignment problem
• Sparse surrogate model for optimization: example of the bus stops spacing problem

Uses Software

• Walksat

This page was built for publication: Computing the moments \(k\)-bounded pseudo-Boolean functions over Hamming spheres of arbitrary radius in polynomial time

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