The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Cartesian Genetic Programming
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Genetic Programming: On the Programming of Computers by Means of Natural Selection
Koza, J. R. (1992) · Medical Entomology and Zoology · Cited by 13,082
The Neutral Theory of Molecular Evolution
Kimura, M. (1979) · Scientific American · doi:10.1038/scientificamerican1179-98 · Cited by 7,666
The Neutral Theory of Molecular Evolution
Kimura, M. (1983) · Cambridge University Press eBooks · doi:10.1017/cbo9780511623486 · Cited by 6,347
Evolutionary Rate at the Molecular Level
KIMURA, M. (1968) · Nature · doi:10.1038/217624a0 · Cited by 3,737
Artificial Intelligence through Simulated Evolution
Fogel, L. J., Owens, A. J., & Walsh, M. J. (1966) · International Linear Collider · Cited by 2,796
Evolutionary Computation: Towards a New Philosophy of Machine Intelligence
Fogel, D. B. (1995) · IEEE Press eBooks · Cited by 2,283
Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2019
Auger, A., & Stützle, T. (2019) · Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles) · Cited by 1,749
The Nearly Neutral Theory of Molecular Evolution
Ohta, T. (1992) · Annual Review of Ecology and Systematics · doi:10.1146/annurev.es.23.110192.001403 · Cited by 1,149
Slightly Deleterious Mutant Substitutions in Evolution
OHTA, T. (1973) · Nature · doi:10.1038/246096a0 · Cited by 1,104
Smoothness within ruggedness: the role of neutrality in adaptation.
Huynen, M. A., Stadler, P. F., & Fontana, W. (1996) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.93.1.397 · Cited by 539
Artificial Intelligence through Simulated Evolution
(2009) · Evolutionary Computation · doi:10.1109/9780470544600.ch7 · Cited by 443
Genotype-phenotype-mapping and neutral variation — A case study in Genetic Programming
Banzhaf, W. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-58484-6_276 · Cited by 180
Through the labyrinth evolution finds a way: A silicon ridge
Harvey, I. R., & Thompson, A. (1997) · Lecture notes in computer science · doi:10.1007/3-540-63173-9_62 · Cited by 141
Langdon, W. B., & Poli, R. (1998) · Cited by 131
Cited by
Deep learning in neural networks: an overview
Schmidhuber, J. (2015) · Neural Networks · doi:10.1016/j.neunet.2014.09.003 · Cited by 18,570
O'Neill, M., & Ryan, C. (2001) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.942529 · Cited by 951
Automatically Designing CNN Architectures Using the Genetic Algorithm for Image Classification
Sun, Y., Xue, B., Zhang, M., Yen, G. G., & Lv, J. (2020) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2020.2983860 · Cited by 870
Compositional pattern producing networks: A novel abstraction of development
Stanley, K. O. (2007) · Genetic Programming and Evolvable Machines · doi:10.1007/s10710-007-9028-8 · Cited by 713
Evolutionary algorithms and their applications to engineering problems
Slowik, A., & Kwasnicka, H. (2020) · Neural Computing and Applications · doi:10.1007/s00521-020-04832-8 · Cited by 712
Metadata
- Authors
- Miller, J. F., & Thomson, P.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2000
- Pages
- 121-132
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1775913388
- Cited by
- 914
- References
- 14
- FWCI
- 10.71
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.