Accelerated genetic programming of polynomials

DOI10.1023/A:1011949326249MaRDI QIDQ2758751zbMATH OpenFDO

Authors Hitoshi Iba, Nikolay I. Nikolaev

Publication date 20 March 2002

Published in Genetic Programming and Evolvable Machines (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/A:1011949326249

zbMATH Keywords

accelerated polynomial constructiongenetic programming

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computing methodologies and applications (68U99)

Recommendations

• Genetic algorithms for the structural optimisation of learned polynomial expressions
• scientific article; zbMATH DE number 1700403
• scientific article; zbMATH DE number 21233
• Polynomial genetic programming for response surface modeling. I. A methodology
• Genetic Programming: Automatic Synthesis of Topologies and Numerical Parameters
• A fast genetic algorithm and its convergence

Cited in

(6)

• Adaptive genetic algorithms used to analyze behavior of complex system
• scientific article; zbMATH DE number 1700403 (Why is no real title available?)
• Hybrid genetic programming and GMDH system: STROGANOFF
• Polynomial genetic programming for response surface modeling. I. A methodology
• Polynomial genetic programming for response surface modeling. II: Adaptive approximate models with probabilistic optimization problems
• Genetical algorithm obtaining minimal polynomial representations for multi-valued output Boolean functions

This page was built for publication: Accelerated genetic programming of polynomials

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