Function approximations by superimposing genetic programming trees: with applications to engineering problems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1354480
- Genetic programming metamodel for rotating beams
- Evaluating the effects of local search in genetic programming
- Smooth fitting with a method for determining the regularization parameter under the genetic programming algorithm
- scientific article; zbMATH DE number 2065678
Cites work
- scientific article; zbMATH DE number 46829 (Why is no real title available?)
- scientific article; zbMATH DE number 795587 (Why is no real title available?)
- scientific article; zbMATH DE number 795588 (Why is no real title available?)
- scientific article; zbMATH DE number 821273 (Why is no real title available?)
- An adaptive conjugate gradient learning algorithm for efficient training of neural networks
- Associative memory approach to the identification of structural and mechanical systems
- Linear and nonlinear associative memories for parameter estimation
- Self-organization and associative memory.
- Weighted linear associative memory approach to nonlinear parameter estimation
Cited in
(3)
This page was built for publication: Function approximations by superimposing genetic programming trees: with applications to engineering problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854043)