Search the dblp DataBase
Jason M. Daida :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
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. [Citation Graph (0, 0)][DBLP ] Evolutionary Programming, 1996, pp:177-186 [Conf ] John Polito , Jason M. Daida , Tommaso F. Bersano-Begey Musica ex Machina: Composing 16th-Century Counterpoint with Genetic Programming and Symbiosis. [Citation Graph (0, 0)][DBLP ] Evolutionary Programming, 1997, pp:113-124 [Conf ] Stephen A. Stanhope , Jason M. Daida An Individually Variable Mutation-Rate Strategy for Genetic Algorithms. [Citation Graph (0, 0)][DBLP ] Evolutionary Programming, 1997, pp:235-246 [Conf ] Stephen A. Stanhope , Jason M. Daida Optimal Mutation and Crossover Rates for a Genetic Algorithm Operating in a Dynamic Environment. [Citation Graph (0, 0)][DBLP ] Evolutionary Programming, 1998, pp:693-702 [Conf ] Stephen A. Stanhope , Jason M. Daida Genetic Programming for Automatic Target Classification and Recognition. [Citation Graph (0, 0)][DBLP ] Evolutionary Programming, 1998, pp:735-744 [Conf ] 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. [Citation Graph (0, 0)][DBLP ] GECCO, 2000, pp:395-402 [Conf ] Jason M. Daida Towards identifying populations that increase the likelihood of success in genetic programming. [Citation Graph (0, 0)][DBLP ] GECCO, 2005, pp:1627-1634 [Conf ] Jason M. Daida Characterizing the dynamics of symmetry breaking in genetic programming. [Citation Graph (0, 0)][DBLP ] GECCO, 2006, pp:799-806 [Conf ] 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. [Citation Graph (0, 0)][DBLP ] GECCO, 1999, pp:1851-1858 [Conf ] Jason M. Daida , Adam M. Hilss Identifying Structural Mechanisms in Standard Genetic Programming. [Citation Graph (0, 0)][DBLP ] GECCO, 2003, pp:1639-1651 [Conf ] Jason M. Daida , Adam M. Hilss , David J. Ward , Stephen L. Long Visualizing Tree Structures in Genetic Programming. [Citation Graph (0, 0)][DBLP ] GECCO, 2003, pp:1652-1664 [Conf ] Jason M. Daida , Hsiaolei Li , Ricky Tang , Adam M. Hilss What Makes a Problem GP-Hard? Validating a Hypothesis of Structural Causes. [Citation Graph (0, 0)][DBLP ] GECCO, 2003, pp:1665-1677 [Conf ] 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. [Citation Graph (0, 0)][DBLP ] GECCO, 1999, pp:982-989 [Conf ] Jason M. Daida , Michael E. Samples , Matthew J. Byom Probing for limits to building block mixing with a tunably-difficult problem for genetic programming. [Citation Graph (0, 0)][DBLP ] GECCO, 2005, pp:1713-1720 [Conf ] Patrick J. Rauss , Jason M. Daida , Shahbaz A. Chaudhary Classification of Spectral Image Using Genetic Programming. [Citation Graph (0, 0)][DBLP ] GECCO, 2000, pp:726-733 [Conf ] Michael E. Samples , Jason M. Daida , Matthew J. Byom , Matt Pizzimenti Parameter sweeps for exploring GP parameters. [Citation Graph (0, 0)][DBLP ] GECCO, 2005, pp:1791-1792 [Conf ] Michael E. Samples , Jason M. Daida , Matthew J. Byom , Matt Pizzimenti Parameter sweeps for exploring GP parameters. [Citation Graph (0, 0)][DBLP ] GECCO Workshops, 2005, pp:212-219 [Conf ] Jason M. Daida , Steven J. Ross , Brian C. Hannan Biological Symbiosis as a Metaphor for Computational Hybridization. [Citation Graph (0, 0)][DBLP ] ICGA, 1995, pp:328-335 [Conf ] Jason M. Daida Hybrid Computational Architectures for Image Segmentation. [Citation Graph (0, 0)][DBLP ] ICIP (3), 1994, pp:831-835 [Conf ] 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. [Citation Graph (0, 0)][DBLP ] Genetic Programming and Evolvable Machines, 2001, v:2, n:2, pp:165-191 [Journal ] Jason M. Daida , Adam M. Hilss , David J. Ward , Stephen L. Long Visualizing Tree Structures in Genetic Programming. [Citation Graph (0, 0)][DBLP ] Genetic Programming and Evolvable Machines, 2005, v:6, n:1, pp:79-110 [Journal ] Search in 0.002secs, Finished in 0.303secs