All Classes and Interfaces
Class
Description
Double tournament selection strategy that combines fitness-based and parsimony-based selection to control bloat in
genetic programming and other evolutionary algorithms.
Defines multiple factory and helper methods to create and manage EAExecutionContexts appropriate for Genetic
Programming
Immutable implementation of
CoefficientOperation.Builds instances of type
CoefficientOperation.Immutable implementation of
DoubleTournament.Builds instances of type
DoubleTournament.Immutable implementation of
InputOperation.Builds instances of type
InputOperation.Immutable implementation of
InputSpec.Builds instances of type
InputSpec.Immutable implementation of
NodeReplacement.Builds instances of type
NodeReplacement.Immutable implementation of
Operation.Builds instances of type
Operation.Immutable implementation of
Program.Builds instances of type
Program.Immutable implementation of
ProgramApplyRules.Builds instances of type
ProgramApplyRules.Immutable implementation of
ProgramRandomCombine.Builds instances of type
ProgramRandomCombine.Immutable implementation of
ProgramRandomMutate.Builds instances of type
ProgramRandomMutate.Immutable implementation of
ProgramRandomPrune.Builds instances of type
ProgramRandomPrune.Immutable implementation of
ProgramTreeChromosomeSpec.Builds instances of type
ProgramTreeChromosomeSpec.Immutable implementation of
Rule.Builds instances of type
Rule.Immutable implementation of
TarpeianMethod.Builds instances of type
TarpeianMethod.Immutable implementation of
TrimTree.Builds instances of type
TrimTree.Represents an operation (function or terminal) in genetic programming.
Factory interface for creating operations in genetic programming.
Ensure no tree will have a greater depth than allowed