Genetic programming: on the programming of computers by means of natural selection
Genetic programming: on the programming of computers by means of natural selection
A Representation for the Adaptive Generation of Simple Sequential Programs
Proceedings of the 1st International Conference on Genetic Algorithms
Grammatical Evolution: Evolving Programs for an Arbitrary Language
EuroGP '98 Proceedings of the First European Workshop on Genetic Programming
Grammatical Evolution: Evolutionary Automatic Programming in an Arbitrary Language
Grammatical Evolution: Evolutionary Automatic Programming in an Arbitrary Language
Meta-grammar constant creation with grammatical evolution by grammatical evolution
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Properties of Gray and Binary Representations
Evolutionary Computation
Constant creation in grammatical evolution
International Journal of Innovative Computing and Applications
Grammar-Based Immune Programming for Symbolic Regression
ICARIS '09 Proceedings of the 8th International Conference on Artificial Immune Systems
Analysis of a digit concatenation approach to constant creation
EuroGP'03 Proceedings of the 6th European conference on Genetic programming
Grammar-based immune programming
Natural Computing: an international journal
A new approach for generating numerical constants in grammatical evolution
Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
IEEE Transactions on Evolutionary Computation
Hi-index | 0.01 |
This paper assesses the new numerical-constant generation method called ephemeral constant, which can be seen as a translation of the classical genetic programming's ephemeral random constant to the grammatical evolution framework. Its most distinctive feature is that it decouples the number of bits used to encode the grammar's production rules from the number of bits used to represent a constant. This makes it possible to increase the method's representational power without incurring in an overly redundant encoding scheme. We present experiments comparing ephemeral constant with the three most popular approaches for constant handling: the traditional approach, digit concatenation, and persistent random constant. By varying the number of bits to represent a constant, we can increase the numerical precision to the desired level of accuracy, overcoming by a large margin the other approaches.