文档介绍：The ic Algorithm puter Science
Eric Krevice Prebys
Abstract. The ic algorithm is described, including its three main steps: selection,
crossover, and mutation. This description is used in the presentation of two methods for
analyzing ic algorithms: schema analysis and mathematical modeling. The discus-
sion of schema analysis focuses on the Schema Theorem. Following it, an exact mathe-
matical model is described. First, the model is presented assuming an infinite population.
Then the model is made more accurate by assuming a finite population.
1. Introduction. All life on Earth is thought to evolve. ic algorithms -
puting algorithms constructed in analogy with the process of evolution [1]. ic
algorithms seem to be useful for searching very general spaces and poorly defined spaces.
It is hoped that, through more rigorous theoretical study, we will determine what sorts
of spaces ic algorithms can search efficiently.
In biology, the gene is the basic unit of ic storage [5]. Within cells, genes
are strung together to form chromosomes. The simplest possible sexual reproduction
is between single-anisms. The two cells fuse to produce a cell with two sets of
chromosomes, called a diploid cell. The diploid cell immediately undergoes meiosis. In
meiosis, each of the chromosomes in the diploid cell makes an exact copy of itself. Then
the chromosome groups (original an