TY - CPAPER
AU - Artur Rataj
AU - M. Szczuka
AU - L. Czaja
AU - M. Kacprzak
AB - We propose a softening of a genetic program by the so-called fractional instructions. Thanks to their adjustable strengths, a new instruction can be gradually introduced to a program, and the other instructions may gradually adapt to the new member. In this way, a transformation of one candidate into another can be continuos. Such an approach makes it possible to take advantage of properties of real-coded genetic algorithms, but in the realm of genetic programming. We show, that the approach can be successfully applied to a precise generalisation of functions, including those exhibiting periodicity.
BT - Proceedings of the 22nd International Workshop on Concurrency, Specification and Programming
LA - eng
N1 - 22th International Workshop on Concurrency, Specification and Programming, Warsaw, Poland, September 25-27, 2013
N2 - We propose a softening of a genetic program by the so-called fractional instructions. Thanks to their adjustable strengths, a new instruction can be gradually introduced to a program, and the other instructions may gradually adapt to the new member. In this way, a transformation of one candidate into another can be continuos. Such an approach makes it possible to take advantage of properties of real-coded genetic algorithms, but in the realm of genetic programming. We show, that the approach can be successfully applied to a precise generalisation of functions, including those exhibiting periodicity.
PY - 2013
EP - 371–382
T2 - Proceedings of the 22nd International Workshop on Concurrency, Specification and Programming
TI - Fractional Genetic Programming for a More Gradual Evolution
ER -