A modification of the standard Simulated Annealing (SA) algorithm is presented for finding the global minimum of a continuous multidimensional, multimodal function. We report resu...
We introduce potential fitness, a variant of fitness function that operates in the space of schemata and is applicable to tree-based genetic programing. The proposed evaluation ...
Abstract. We introduce, analyze, and experimentally examine co-solvability, an ability of a solution to solve a pair of fitness cases (tests). Based on this concept, we devise a co...
The great majority of genetic programming (GP) algorithms that deal with the classification problem follow a supervised approach, i.e., they consider that all fitness cases availab...
Junio de Freitas, Gisele L. Pappa, Altigran Soares...
Cellular Genetic Algorithms (cGAs) are a subclass of Genetic Algorithms (GAs) in which the population diversity and exploration are enhanced thanks to the existence of small overla...