Coordinate System Extraction as the Search Driver in Test-Based Genetic Programming
Open Access
- 13 July 2025
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 1081-1089
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- Identifying Informatively Easy and Informatively Hard ConceptsACM Transactions on Computing Education, 2021
- Online Discovery of Search Objectives for Test-Based ProblemsEvolutionary Computation, 2017
- An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point-Based Nondominated Sorting Approach, Part I: Solving Problems With Box ConstraintsIEEE Transactions on Evolutionary Computation, 2013
- Formal Analysis, Hardness, and Algorithms for Extracting Internal Structure of Test-Based ProblemsEvolutionary Computation, 2011
- Coordinate System Archive for coevolution2010
- Objective Set Compression2008
- Ideal Evaluation from CoevolutionEvolutionary Computation, 2004
- A fast and elitist multiobjective genetic algorithm: NSGA-IIIEEE Transactions on Evolutionary Computation, 2002
- Genetic programming as a means for programming computers by natural selectionStatistics and Computing, 1994
- The Evolution of CooperationScience, 1981