<LI><A NAME="tex2html2" HREF="node1.html#92">Evaluating individuals determines which is better.</A>
<LI><A NAME="tex2html3" HREF="node1.html#98">Selection acts as a sieve, selecting better individuals to continue.</A>
<LI><A NAME="tex2html4" HREF="node1.html#104">Crossover of the two parents P1 and P2 produces the two children C1
and C2. Each child consists of parts from both parents which leads to 
information exchange.</A>
<LI><A NAME="tex2html6" HREF="node2.html#188">The one-to-one correspondence between the three phase model and the
genetic algorithm.</A>
<LI><A NAME="tex2html8" HREF="node2.html#222">Dimensionless floor plan of a three bedroom apartment</A>
<LI><A NAME="tex2html9" HREF="node3.html#347">A hill-climbing deceptive function that should be easy for GAs</A>
<LI><A NAME="tex2html10" HREF="node3.html#352">An alternate view of a hill-climbing deceptive space that should
be easy for GAs (10 bits)</A>
<LI><A NAME="tex2html11" HREF="node3.html#383">A graphical representation of solution points on a two-criteria
optimization problem. The points within the shaded area represent the pareto
optimal set of solutions.</A>
<LI><A NAME="tex2html12" HREF="node3.html#418">Performance comparison for string length 30. The peak width is 2.</A>
<LI><A NAME="tex2html13" HREF="node3.html#423">Performance comparison for string length 30 but with peak width 4.</A>
<LI><A NAME="tex2html17" HREF="node3.html#462">The shape easier for GAs and harder for hill-climbers, <I>d</I> denotes the
size of the deceptive basin.</A>
<LI><A NAME="tex2html18" HREF="node3.html#470">The vertical axis indicates the probability of finding the global
optimum in terms of mutation rate ( <IMG WIDTH=23 HEIGHT=18 ALIGN=MIDDLE ALT="tex2html_wrap_inline2413" SRC="img42.gif"  > ) and length of deceptive basin (<I>d</I>).</A>
<LI><A NAME="tex2html19" HREF="node4.html#518">Inversion. Notice that after inversion ``A'' is close to ``B''</A>
<LI><A NAME="tex2html20" HREF="node4.html#565">Masked crossover. The bits that are exchanged depend on the masks.
This allows preservation of schemas of arbitrary defining length</A>
<LI><A NAME="tex2html21" HREF="node4.html#610">Six ways of pairing children and their associated mask functions/rules
(MF).</A>
<LI><A NAME="tex2html22" HREF="node4.html#775">Mask rule  <IMG WIDTH=44 HEIGHT=27 ALIGN=MIDDLE ALT="tex2html_wrap_inline2759" SRC="img77.gif"  > : Example of mask propagation when both C1 and C2
are good</A>
<LI><A NAME="tex2html24" HREF="node4.html#642">A mapping from a two-dimensional phenotypic structure (circuit) to
position in a  one-dimensional genotype.</A>
<LI><A NAME="tex2html25" HREF="node4.html#652">A gate in a two-dimensional template gets its second input
from either one of two gates in the previous column.</A>
<LI><A NAME="tex2html26" HREF="node4.html#660">Performance comparison of maximum fitness per generation of a
classical GA versus a DGA on a 2-bit adder.</A>
<LI><A NAME="tex2html27" HREF="node4.html#665">Performance comparison of average fitness per generation of a
classical GA versus a DGA on a 2-bit adder.</A>
<LI><A NAME="tex2html28" HREF="node4.html#673">A 2-bit adder designed by a designer genetic algorithm.</A>
<LI><A NAME="tex2html29" HREF="node4.html#678">A 2-bit adder designed by a classical genetic algorithm.</A>
<LI><A NAME="tex2html30" HREF="node4.html#687">The XOR gates that are close together (diagonally) in the
two-dimensional grid will be far apart when mapped to a one-dimensional
genotype</A>
<LI><A NAME="tex2html31" HREF="node4.html#694">Performance comparison of maximum fitness per generation of a
classical GA versus a DGA on a 4-bit parity checker.</A>
<LI><A NAME="tex2html32" HREF="node4.html#699">Performance comparison of average fitness per generation of a
classical GA versus a DGA on a 4-bit parity checker.</A>
<LI><A NAME="tex2html33" HREF="node4.html#704">Performance comparison of maximum fitness per generation of a
classical GA versus a DGA on a 5-bit parity checker.</A>
<LI><A NAME="tex2html34" HREF="node4.html#709">Performance comparison of average fitness per generation of a
classical GA versus a DGA on a 5-bit parity checker.</A>
<LI><A NAME="tex2html35" HREF="node4.html#714">Performance comparison of maximum fitness per generation of a
classical GA versus a DGA on a 6-bit parity checker.</A>
<LI><A NAME="tex2html36" HREF="node4.html#719">Performance comparison of average fitness per generation of a
classical GA versus a DGA on a 6-bit parity checker.</A>
<LI><A NAME="tex2html37" HREF="node4.html#738">Change in performance difference as the length of high fitness schemas
(proportional to problem size) increases. Comparing a 5-bit and 6-bit parity
checker performance difference. The vertical axis for the 6-bit plot is now to
the same scale as the five bit plot. The increase in performance difference is
clearer.</A>
<LI><A NAME="tex2html38" HREF="node4.html#745">Performance comparison of maximum fitness per generation of a
classical GA using traditional selection, a classical GA with elitist
selection, and a DGA on a 5-bit parity checker. </A>
<LI><A NAME="tex2html39" HREF="node4.html#750">Performance comparison of average fitness per generation of a
classical GA using traditional selection, a classical GA with elitist
selection, and a DGA on a 5-bit parity checker. </A>
<LI><A NAME="tex2html40" HREF="node4.html#757">A circuit designed by a designer genetic algorithm that solves the
4-bit parity problem.</A>
<LI><A NAME="tex2html41" HREF="node4.html#762">A circuit designed by a classical genetic algorithm that solves the
4-bit parity problem.</A>
<LI><A NAME="tex2html42" HREF="node5.html#858">Schematic diagram of the system</A>
<LI><A NAME="tex2html43" HREF="node5.html#865">A small subsection of a typical binary tree
created by the clustering algorithm.  Individuals are represented by
the numbers at the leaves.  Internal nodes where abstract cases go are
denoted with a ``*''.  The binary tree provides an index for the case-base.</A>
<LI><A NAME="tex2html44" HREF="node5.html#968">Tree  structure of the cases.  Nodes represent
abstracted cases.</A>
<LI><A NAME="tex2html45" HREF="node5.html#970">A closer  look at the clustered cases reveals nested
schemas.</A>
<LI><A NAME="tex2html46" HREF="node5.html#910">Parity circuit indicated by <I>H</I>, and the correct instantiation of
choices.</A>
<LI><A NAME="tex2html48" HREF="node6.html#1674">Average  fitness over 100 generations of classical GA
and GA with complements. GAC (max) replaces the worst individual with the
complement of the current best individual. GAC (random) replaces the worst
individual with the complement of a random individual in the population</A>
<LI><A NAME="tex2html49" HREF="node6.html#1676">Number of times the optimum was found on <B>Dec1</B> for a classical GA
compared with the same statistic for GAs with complements (GACs).</A>
<LI><A NAME="tex2html50" HREF="node6.html#1678">Number of times the optimum was found on <B>Dec2</B> for a classical GA
compared with GAs with complements (GACs).</A>
<LI><A NAME="tex2html55" HREF="node7.html#1765">The type of spaces easy for a genetic algorithm and hard for a
stochastic hill-climber</A>
<LI><A NAME="tex2html56" HREF="node7.html#1776">Comparing convergence behavior of a simulated annealer and a genetic
algorithm</A>
<LI><A NAME="tex2html57" HREF="node9.html#1930">Mask rule  <IMG WIDTH=44 HEIGHT=27 ALIGN=MIDDLE ALT="tex2html_wrap_inline2759" SRC="img77.gif"  > : Example of mask propagation when both C1 and C2
are good</A>
<LI><A NAME="tex2html58" HREF="node9.html#1933">Mask rule  <IMG WIDTH=43 HEIGHT=27 ALIGN=MIDDLE ALT="tex2html_wrap_inline4081" SRC="img231.gif"  > : Example of mask propagation when both C1 and C2
are bad.</A>
<LI><A NAME="tex2html59" HREF="node9.html#1936">Mask rule  <IMG WIDTH=45 HEIGHT=27 ALIGN=MIDDLE ALT="tex2html_wrap_inline4157" SRC="img236.gif"  > , Part 1: Example of mask propagation when C1 is
bad and C2 is average. (<I>C</I>1 &lt; <I>P</I>1 &lt; <I>C</I>2 &lt; <I>P</I>2)</A>
<LI><A NAME="tex2html60" HREF="node9.html#1939">Mask rule  <IMG WIDTH=45 HEIGHT=27 ALIGN=MIDDLE ALT="tex2html_wrap_inline4157" SRC="img236.gif"  > , Part 2: Example of mask propagation when C1 is
bad and C2 is average. (<I>C</I>1 &lt; <I>P</I>2 &lt; <I>C</I>2 &lt; <I>P</I>1)</A>
<LI><A NAME="tex2html61" HREF="node9.html#1942">Mask rule  <IMG WIDTH=46 HEIGHT=27 ALIGN=MIDDLE ALT="tex2html_wrap_inline4383" SRC="img240.gif"  > , Example of mask propagation when both C1 and C2
are average.</A>
<LI><A NAME="tex2html62" HREF="node9.html#1945">Mask rule  <IMG WIDTH=45 HEIGHT=27 ALIGN=MIDDLE ALT="tex2html_wrap_inline4447" SRC="img242.gif"  > , Part 1: Example of Mask propagation when C1
is average and C2 is good. (<I>P</I>1 &lt; <I>C</I>1 &lt; <I>P</I>2 &lt; <I>C</I>2)</A>
<LI><A NAME="tex2html63" HREF="node9.html#1948">Mask rule  <IMG WIDTH=45 HEIGHT=27 ALIGN=MIDDLE ALT="tex2html_wrap_inline4447" SRC="img242.gif"  > , Part 2: Example of Mask propagation when C1
is average and C2 is good. (<I>P</I>2 &lt; <I>C</I>1 &lt; <I>P</I>1 &lt; <I>C</I>2)</A>
<LI><A NAME="tex2html64" HREF="node9.html#1951">Mask rule  <IMG WIDTH=44 HEIGHT=27 ALIGN=MIDDLE ALT="tex2html_wrap_inline4565" SRC="img245.gif"  > : Example of Mask propagation when C1 is bad
and C2 is good</A>
<LI><A NAME="tex2html65" HREF="node10.html#1977">Tree  structure of the cases for a 5-bit parity checker</A>
