Genetic Algorithms, Floating Point Numbers and Applications

Created by W.Langdon from gp-bibliography.bib Revision:1.8051

@Article{hardy05a,

• author = "Yorick Hardy and Willi-Hans Steeb and Ruedi Stoop",
• title = "Genetic Algorithms, Floating Point Numbers and Applications",
• journal = "International Journal of Modern Physics C",
• volume = "16",
• pages = "1811--1816",
• year = "2005",
• keywords = "genetic algorithms, genetic programming, crossing, mutation, floating point numbers",
• DOI = "doi:10.1142/S0129183105008321",
• URL = "http://dx.doi.org/10.1142/S0129183105008321",
• abstract = "The core in most genetic algorithms is the bitwise manipulations of bit strings. We show that one can directly manipulate the bits in floating point numbers. This means the main bitwise operations in genetic algorithm mutations and crossings are directly done inside the floating point number. Thus the interval under consideration does not need to be known in advance. For applications, we consider the roots of polynomials and finding solutions of linear equations.",

}

Genetic Programming entries for Yorick Hardy Willi-Hans Steeb Ruedi Stoop

Citations