Dwight Deugo and Franz Oppacher, "Explicitely Schema Based Genetic Algorithms," In Proceedings of the Canadian Conference on Artificial Intelligence, 1990. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Genetic Programming with Adaptive Representations - Rosca, Ballard (1994) (8 citations) (Correct)
....be theoretically used as a measure of suitability of a representation. The design of a good representation should reconcile two conflicting goals: allow easy exchange and variation of genetic material and define operators that preserve as much genetic material form the parent strings as possible [Deugo and Oppacher, 1990]. Antonisse, 1989] argues for the idea that a more expressive alphabet carries more power in an informationally equivalent environment. He uses a different interpretation of schema notation, in which don t care symbols quantify over subsets of symbols that can occupy a given string position. ....
Dwight Deugo and Franz Oppacher, "Explicitely Schema Based Genetic Algorithms," In Proceedings of the Canadian Conference on Artificial Intelligence, 1990.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC