Genetic Programming Bibliography entries for Bryant A Julstrom

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

Genetic Programming conference papers by Bryant A Julstrom

• Bryant A. Julstrom. Manipulating Valid Solutions in a Genetic Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem. In Erick Cant\'u-Paz editor, Late Breaking Papers at the Genetic and Evolutionary Computation Conference (GECCO-2002), pages 247-254, New York, NY, 2002. AAAI. details

• Bryant A. Julstrom. Strings of Weights as Chromosomes in Genetic Algorithms for the Traveling Salesman Problem. In John R. Koza editor, Late Breaking Papers at the 1997 Genetic Programming Conference, pages 100-106, Stanford University, CA, USA, 1997. Stanford Bookstore. details

• Bryant A. Julstrom. Contest Length, Noise, and Reciprocal Altruism in the Population of a Genetic Algorithm for the Iterated Prisoner's Dilemma. In John R. Koza editor, Late Breaking Papers at the Genetic Programming 1996 Conference Stanford University July 28-31, 1996, pages 88-93, Stanford University, CA, USA, 1996. Stanford Bookstore. details