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

DOI10.1016/j.tcs.2011.02.006zbMath1237.68195MaRDI QIDQ418028

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

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

zbMATH Keywords

local search; fitness landscape analysis; pseudo-Boolean functions; elementary landscapes; Walsh analysis

Mathematics Subject Classification ID

68T05: Learning and adaptive systems in artificial intelligence

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

06E30: Boolean functions

Related Items

The component model for elementary landscapes and partial neighborhoods, Exact computation of the expectation surfaces for uniform crossover along with bit-flip mutation, Random walk's correlation function for multi-objective NK landscapes and quadratic assignment problem

Uses Software

• Walksat

Cites Work

• Almost tight upper bound for finding Fourier coefficients of bounded pseudo-Boolean functions
• Local search and the local structure of NP-complete problems
• Landscapes and their correlation functions
• Combinatorial Landscapes
• On the landscape ruggedness of the quadratic assignment problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item