2007 |
23 | EE | Michael E. Samples,
Matthew J. Byom,
Jason M. Daida:
Parameter Sweeps for Exploring Parameter Spaces of Genetic and Evolutionary Algorithms.
Parameter Setting in Evolutionary Algorithms 2007: 161-184 |
2006 |
22 | EE | Jason M. Daida:
Characterizing the dynamics of symmetry breaking in genetic programming.
GECCO 2006: 799-806 |
2005 |
21 | EE | Jason M. Daida:
Towards identifying populations that increase the likelihood of success in genetic programming.
GECCO 2005: 1627-1634 |
20 | EE | Jason M. Daida,
Michael E. Samples,
Matthew J. Byom:
Probing for limits to building block mixing with a tunably-difficult problem for genetic programming.
GECCO 2005: 1713-1720 |
19 | EE | Michael E. Samples,
Jason M. Daida,
Matthew J. Byom,
Matt Pizzimenti:
Parameter sweeps for exploring GP parameters.
GECCO 2005: 1791-1792 |
18 | EE | Michael E. Samples,
Jason M. Daida,
Matthew J. Byom,
Matt Pizzimenti:
Parameter sweeps for exploring GP parameters.
GECCO Workshops 2005: 212-219 |
17 | EE | Jason M. Daida,
Adam M. Hilss,
David J. Ward,
Stephen L. Long:
Visualizing Tree Structures in Genetic Programming.
Genetic Programming and Evolvable Machines 6(1): 79-110 (2005) |
2003 |
16 | EE | Jason M. Daida,
Adam M. Hilss:
Identifying Structural Mechanisms in Standard Genetic Programming.
GECCO 2003: 1639-1651 |
15 | EE | Jason M. Daida,
Adam M. Hilss,
David J. Ward,
Stephen L. Long:
Visualizing Tree Structures in Genetic Programming.
GECCO 2003: 1652-1664 |
14 | EE | Jason M. Daida,
Hsiaolei Li,
Ricky Tang,
Adam M. Hilss:
What Makes a Problem GP-Hard? Validating a Hypothesis of Structural Causes.
GECCO 2003: 1665-1677 |
2001 |
13 | | Jason M. Daida,
Robert R. Bertram,
Stephen A. Stanhope,
Jonathan C. Khoo,
Shahbaz A. Chaudhary,
Omer A. Chaudhri,
John Polito:
What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming.
Genetic Programming and Evolvable Machines 2(2): 165-191 (2001) |
2000 |
12 | | Omer A. Chaudhri,
Jason M. Daida,
Jonathan C. Khoo,
Wendell S. Richardsons,
Rachel Harrison,
William J. Sloat:
Characterizing a Tunably Difficult Problem in Genetic Programming.
GECCO 2000: 395-402 |
11 | | Patrick J. Rauss,
Jason M. Daida,
Shahbaz A. Chaudhary:
Classification of Spectral Image Using Genetic Programming.
GECCO 2000: 726-733 |
1999 |
10 | | Wolfgang Banzhaf,
Jason M. Daida,
A. E. Eiben,
Max H. Garzon,
Vasant Honavar,
Mark J. Jakiela,
Robert E. Smith:
Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 1999), 13-17 July 1999, Orlando, Florida, USA
Morgan Kaufmann 1999 |
9 | | Jason M. Daida,
Derrick S. Ampy,
Michael Ratanasavetavadhana,
Hsiaolei Li,
Omar A. Chaudhri:
Challenges with Verification, Repeatability, and Meaningful Comparison in Genetic Programming: Gibson's Magic.
GECCO 1999: 1851-1858 |
8 | | Jason M. Daida,
John Polito,
Steven A. Stanhope,
Robert R. Bertram,
Jonathan C. Khoo,
Shahbaz A. Chaudhary:
What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming.
GECCO 1999: 982-989 |
1998 |
7 | | Stephen A. Stanhope,
Jason M. Daida:
Optimal Mutation and Crossover Rates for a Genetic Algorithm Operating in a Dynamic Environment.
Evolutionary Programming 1998: 693-702 |
6 | | Stephen A. Stanhope,
Jason M. Daida:
Genetic Programming for Automatic Target Classification and Recognition.
Evolutionary Programming 1998: 735-744 |
1997 |
5 | | John Polito,
Jason M. Daida,
Tommaso F. Bersano-Begey:
Musica ex Machina: Composing 16th-Century Counterpoint with Genetic Programming and Symbiosis.
Evolutionary Programming 1997: 113-124 |
4 | | Stephen A. Stanhope,
Jason M. Daida:
An Individually Variable Mutation-Rate Strategy for Genetic Algorithms.
Evolutionary Programming 1997: 235-246 |
1996 |
3 | | Jason M. Daida,
Catherine S. Grasso,
Stephen A. Stanhope,
Steven J. Ross:
Symbionticism and Complex Adaptive Systems I: Implications of Having Symbiosis Occur in Nature.
Evolutionary Programming 1996: 177-186 |
1995 |
2 | | Jason M. Daida,
Steven J. Ross,
Brian C. Hannan:
Biological Symbiosis as a Metaphor for Computational Hybridization.
ICGA 1995: 328-335 |
1994 |
1 | | Jason M. Daida:
Hybrid Computational Architectures for Image Segmentation.
ICIP (3) 1994: 831-835 |