Best approximations of fitness functions of binary strings

DOI10.1023/B:NACO.0000023418.20610.4DMaRDI QIDQ1768787zbMATH OpenOpenAlexFDO

Authors Hang Zhang, Jonathan E. Rowe

Publication date 15 March 2005

Published in Natural Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/b:naco.0000023418.20610.4d

zbMATH Keywords

approximationfitness functionpseudo-boolean function

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Nonnumerical algorithms (68W05)

Recommendations

• Artificial Evolution
• Lower bounds for approximation schemes for Closest String
• Approximating the distribution of fitness over Hamming regions
• scientific article; zbMATH DE number 3357841
• On the complexity of the string generation problem
• scientific article; zbMATH DE number 515901
• Low autocorrelation binary sequences: exact enumeration and optimization by evolutionary strategies
• Improved optimization modelling for the closest string and related problems

Cited in

(3)

• Approximating the distribution of fitness over Hamming regions
• Formulas for approximating pseudo-Boolean random variables
• Transforms of pseudo-Boolean random variables

This page was built for publication: Best approximations of fitness functions of binary strings

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