Schema Theory without Expectations for GPand GAs with One - Point Crossover in thePresence of Schema
نویسنده
چکیده
This paper presents new theoretical results on GA and GP schemata which allow one to predict with a known probability whether the number of instances of a given schema at the next generation is going to be above a given threshold. Unlike previous results, the schema theory presented in this paper does not use expected values and accounts for schema creation.
منابع مشابه
Schema Theory without Expectations for GP and GAs with One-Point Crossover in the Presence of Schema Creation
This paper presents new theoretical results on GA and GP schemata which allow one to predict with a known probability whether the number of instances of a given schema at the next generation is going to be above a given threshold. Unlike previous results, the schema theory presented in this paper does not use expected values and accounts for schema creation.
متن کاملA New Schema Theory for Genetic Programming with One-point Crossover and Point Mutation
In this paper we first review the main results obtained in the theory of schemata in Genetic Programming (GP) emphasising their strengths and weaknesses. Then we propose a new, simpler definition of the concept of schema for GP which is quite close to the original concept of schema in genetic algorithms (GAs). Along with a new form of crossover, one-point crossover, and point mutation this conc...
متن کاملA New Schema Theorem for GeneticProgramming with One - point
We review the main results obtained in the theory of schemata in Genetic Programming (GP) emphasising their strengths and weaknesses. Then we propose a new, simpler deenition of the concept of schema for GP which is closer to the original concept of schema in genetic algorithms (GAs). Along with a new form of crossover, one-point crossover, and point mutation this concept of schema has been use...
متن کاملSchema Theory for Genetic Programming with One-Point Crossover and Point Mutation
We review the main results obtained in the theory of schemata in genetic programming (GP), emphasizing their strengths and weaknesses. Then we propose a new, simpler definition of the concept of schema for GP, which is closer to the original concept of schema in genetic algorithms (GAs). Along with a new form of crossover, one-point crossover, and point mutation, this concept of schema has been...
متن کاملGeneral Schema Theory for Genetic Programming with Subtree-Swapping Crossover: Part II
This paper is the second part of a two-part paper which introduces a general schema theory for genetic programming (GP) with subtree-swapping crossover (Part I (Poli and McPhee, 2003)). Like other recent GP schema theory results, the theory gives an exact formulation (rather than a lower bound) for the expected number of instances of a schema at the next generation. The theory is based on a Car...
متن کامل