Computing the moments \(k\)-bounded pseudo-Boolean functions over Hamming spheres of arbitrary radius in polynomial time
From MaRDI portal
Publication:418028
DOI10.1016/j.tcs.2011.02.006zbMath1237.68195OpenAlexW2135960340MaRDI 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
Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Boolean functions (06E30)
Related Items (3)
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
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
This page was built for publication: Computing the moments \(k\)-bounded pseudo-Boolean functions over Hamming spheres of arbitrary radius in polynomial time