|
Prikladnaya Diskretnaya Matematika, 2012, Number 3(17), Pages 85–95
(Mi pdm379)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Computational Methods in Discrete Mathematics
Influence of template specialization degree on the search space in evolutionary synthesis of models
O. G. Monakhov Institute of Computational Mathematics and Mathematical Geophysics (Computing Center), Siberian Branch of the Russian Academy of Sciences, Novosibirsk, Russia
Abstract:
An algorithm for evolutionary synthesis is presented. It combines the advantages of genetic algorithms and genetic programming based on evolutionary computation, template (pattern, skeleton) of algorithm and a given set of pairs of input-output data. The influence of template specialization degree on the search space in the evolutionary synthesis is investigated. Estimates are obtained for the reduction of the search space with the introducing an additional information of template in the form of formulas represented by binary trees and refining the model. The exponential and superexponential reduction in the time of the synthesis algorithm with the increasing the template specialization degree is shown theoretically and experimentally.
Keywords:
genetic algorithms, genetic programming, evolutionary synthesis, template, design pattern.
Citation:
O. G. Monakhov, “Influence of template specialization degree on the search space in evolutionary synthesis of models”, Prikl. Diskr. Mat., 2012, no. 3(17), 85–95
Linking options:
https://www.mathnet.ru/eng/pdm379 https://www.mathnet.ru/eng/pdm/y2012/i3/p85
|
Statistics & downloads: |
Abstract page: | 180 | Full-text PDF : | 69 | References: | 35 | First page: | 1 |
|