Free lunches for function and program induction

DOI10.1145/1527125.1527148MaRDI QIDQ5276077zbMATH OpenOpenAlexWikidataFDO

Authors Riccardo Poli, Mario Graff, Nicholas Freitag McPhee

Publication date 14 July 2017

Published in Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms (Search for Journal in Brave)

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

zbMATH Keywords

genetic programmingno-free lunch

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1962079
• Continuous lunches are free plus the design of optimal optimization algorithms
• Conditions that obviate the no-free-lunch theorems for optimization
• A ``no free lunch tutorial: sharpened and focused no free lunch
• scientific article; zbMATH DE number 2040662

Cited in

(3)

• Absolutely no free lunches!
• scientific article; zbMATH DE number 1962079 (Why is no real title available?)
• Practical performance models of algorithms in evolutionary program induction and other domains

This page was built for publication: Free lunches for function and program induction

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