The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jason M. Daida: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. 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]
  3. 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]
  4. 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]
  5. 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]
  6. 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]
  7. 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]
  8. Jason M. Daida
    Characterizing the dynamics of symmetry breaking in genetic programming. [Citation Graph (0, 0)][DBLP]
    GECCO, 2006, pp:799-806 [Conf]
  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. [Citation Graph (0, 0)][DBLP]
    GECCO, 1999, pp:1851-1858 [Conf]
  10. Jason M. Daida, Adam M. Hilss
    Identifying Structural Mechanisms in Standard Genetic Programming. [Citation Graph (0, 0)][DBLP]
    GECCO, 2003, pp:1639-1651 [Conf]
  11. 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]
  12. 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]
  13. 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]
  14. 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]
  15. 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]
  16. 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]
  17. 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]
  18. 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]
  19. Jason M. Daida
    Hybrid Computational Architectures for Image Segmentation. [Citation Graph (0, 0)][DBLP]
    ICIP (3), 1994, pp:831-835 [Conf]
  20. 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]
  21. 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.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002