General Boolean Function Benchmark Suite

DOI10.1145/3594805.3607131MaRDI QIDQ6120972zbMATH OpenFDO

Authors Zdeněk Vašíček, Diederick Vermetten, Furong Ye, Thomas Bäck

Publication date 23 February 2024

Published in Proceedings of the 17th ACM/SIGEVO Conference on Foundations of Genetic Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1145/3594805.3607131

zbMATH Keywords

benchmarkinggenetic programminglogic synthesis

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Approximation methods and heuristics in mathematical programming (90C59)

Cites work

• Cartesian genetic programming.
• COCO: a platform for comparing continuous optimizers in a black-box setting
• scientific article; zbMATH DE number 5862915 (Why is no real title available?)
• scientific article; zbMATH DE number 4166880 (Why is no real title available?)
• scientific article; zbMATH DE number 6900649 (Why is no real title available?)
• scientific article; zbMATH DE number 4114079 (Why is no real title available?)
• scientific article; zbMATH DE number 2087177 (Why is no real title available?)
• scientific article; zbMATH DE number 918600 (Why is no real title available?)
• On a Test of Whether one of Two Random Variables is Stochastically Larger than the Other
• On the number of bent functions from iterative constructions: lower bounds and hypotheses
• Symmetric Boolean Functions

This page was built for publication: General Boolean Function Benchmark Suite

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