Genetic programming: on the programming of computers by means of natural selection
Genetic programming: on the programming of computers by means of natural selection
Expected gains from parallelizing constraint solving for hard problems
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
The evolution of evolvability in genetic programming
Advances in genetic programming
Genetic programming and emergent intelligence
Advances in genetic programming
Explicitly defined introns and destructive crossover in genetic programming
Advances in genetic programming
Discovery of subroutines in genetic programming
Advances in genetic programming
Type inheritance in strongly typed genetic programming
Advances in genetic programming
Algorithm 457: finding all cliques of an undirected graph
Communications of the ACM
Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control and Artificial Intelligence
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Workshop, October 11-13, 1993
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
IEEE Expert: Intelligent Systems and Their Applications
Genetic Programming for Feature Discovery and Image Discrimination
Proceedings of the 5th International Conference on Genetic Algorithms
Shall We Repair? Genetic AlgorithmsCombinatorial Optimizationand Feasibility Constraints
Proceedings of the 5th International Conference on Genetic Algorithms
A Hybrid Genetic Algorithm for the Maximum Clique Problem
Proceedings of the 6th International Conference on Genetic Algorithms
Two Ways of Discovering the Size and Shape of a Computer Program to Solve a Problem
Proceedings of the 6th International Conference on Genetic Algorithms
Causality in Genetic Programming
Proceedings of the 6th International Conference on Genetic Algorithms
Solving Equal Piles with the Grouping Genetic Algorithm
Proceedings of the 6th International Conference on Genetic Algorithms
An analysis of genetic programming
An analysis of genetic programming
Collective adaptation: the sharing of building blocks
Collective adaptation: the sharing of building blocks
Empirical studies of the genetic algorithm with noncoding segments
Evolutionary Computation
Strongly typed genetic programming
Evolutionary Computation
Using genetic programming to approximate maximum clique
GECCO '96 Proceedings of the 1st annual conference on Genetic and evolutionary computation
Duplication of coding segments in genetic programming
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Depth-fair crossover in genetic programming
Proceedings of the 1999 ACM symposium on Applied computing
Distributed collective adaptation applied to a hard combinatorial optimization problem
Proceedings of the 1999 ACM symposium on Applied computing
Distributing collective adaptation via message passing
Proceedings of the 1999 ACM symposium on Applied computing
Genetic Programming Bloat without Semantics
PPSN VI Proceedings of the 6th International Conference on Parallel Problem Solving from Nature
Fighting Bloat with Nonparametric Parsimony Pressure
PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
Modification point depth and genome growth in genetic programming
Evolutionary Computation
A comparison of bloat control methods for genetic programming
Evolutionary Computation
Genetic transposition in tree-adjoining grammar guided genetic programming: the duplication operator
EuroGP'05 Proceedings of the 8th European conference on Genetic Programming
Operator equalisation for bloat free genetic programming and a survey of bloat control methods
Genetic Programming and Evolvable Machines
Hi-index | 0.00 |
Coding segments are those subsegments of the chromosome that contribute positively to the fitness evaluation of the chromosome. Clique detection is a NP-complete problem in which we can detect such coding segments. We extract coding segments from chromosomes, and we investigate the duplication of coding segments inside the chromosome and the collection of coding segments outside of the chromosome. We find that duplication of coding segments inside the chromosomes provides a back-up mechanism for the search heuristics. We further find local search in a collective memory of coding segments outside of the chromosome, collective adaptation, enables the search heuristic to represent partial solutions that are larger than realistic chromosomes lengths and to express the solution outside of the chromosome.