default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJason M. Daida
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2007
[p1]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
- [c24]Jason M. Daida:
Characterizing the dynamics of symmetry breaking in genetic programming. GECCO 2006: 799-806 - 2005
- [j2]Jason M. Daida, Adam M. Hilss, David J. Ward, Stephen L. Long:
Visualizing Tree Structures in Genetic Programming. Genet. Program. Evolvable Mach. 6(1): 79-110 (2005) - [c23]Michael E. Samples, Jason M. Daida, Matthew J. Byom, Matt Pizzimenti:
Parameter sweeps for exploring GP parameters. GECCO Workshops 2005: 212-219 - [c22]Jason M. Daida:
Towards identifying populations that increase the likelihood of success in genetic programming. GECCO 2005: 1627-1634 - [c21]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 - [c20]Michael E. Samples, Jason M. Daida, Matthew J. Byom, Matt Pizzimenti:
Parameter sweeps for exploring GP parameters. GECCO 2005: 1791-1792 - 2004
- [c19]Jason M. Daida, Michael E. Samples, Bryan T. Hart, Jeffry Halim, Aditya Kumar:
Demonstrating constraints to diversity with a tunably difficult problem for genetic programming. IEEE Congress on Evolutionary Computation 2004: 1217-1224 - [c18]Jason M. Daida, David J. Ward, Adam M. Hilss, Stephen L. Long, Mark R. Hodges, Jason T. Kriesel:
Visualizing the loss of diversity in genetic programming. IEEE Congress on Evolutionary Computation 2004: 1225-1232 - 2003
- [c17]Jason M. Daida, Adam M. Hilss:
Identifying Structural Mechanisms in Standard Genetic Programming. GECCO 2003: 1639-1651 - [c16]Jason M. Daida, Adam M. Hilss, David J. Ward, Stephen L. Long:
Visualizing Tree Structures in Genetic Programming. GECCO 2003: 1652-1664 - [c15]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 - 2002
- [c14]Jason M. Daida:
Limits to expression in genetic programming: lattice-aggregate modeling. IEEE Congress on Evolutionary Computation 2002: 273-278 - 2001
- [j1]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. Genet. Program. Evolvable Mach. 2(2): 165-191 (2001) - 2000
- [c13]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 - [c12]Patrick J. Rauss, Jason M. Daida, Shahbaz A. Chaudhary:
Classification of Spectral Image Using Genetic Programming. GECCO 2000: 726-733
1990 – 1999
- 1999
- [c11]Jason M. Daida, Seth P. Yalcin, Paul M. Litvak, Gabriel A. Eickhoff, John A. Polit:
Of metaphors and Darwinism: deconstructing genetic programming's chimera. CEC 1999: 453-462 - [c10]Stephen A. Stanhope, Jason M. Daida:
(1+1) genetic algorithm fitness dynamics in a changing environment. CEC 1999: 1851-1858 - [c9]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 - [c8]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 - [e1]Wolfgang Banzhaf, Jason M. Daida, A. E. Eiben, Max H. Garzon, Vasant G. 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, ISBN 1-55860-611-4 [contents] - 1998
- [c7]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 - [c6]Stephen A. Stanhope, Jason M. Daida:
Genetic Programming for Automatic Target Classification and Recognition. Evolutionary Programming 1998: 735-744 - 1997
- [c5]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 - [c4]Stephen A. Stanhope, Jason M. Daida:
An Individually Variable Mutation-Rate Strategy for Genetic Algorithms. Evolutionary Programming 1997: 235-246 - 1996
- [c3]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
- [c2]Jason M. Daida, Steven J. Ross, Brian C. Hannan:
Biological Symbiosis as a Metaphor for Computational Hybridization. ICGA 1995: 328-335 - 1994
- [c1]Jason M. Daida:
Hybrid Computational Architectures for Image Segmentation. ICIP (3) 1994: 831-835
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
