Modifier and Type | Field and Description |
---|---|
Problem |
Evaluator.p_problem |
Modifier and Type | Class and Description |
---|---|
class |
Ant
Ant implements the Artificial Ant problem.
|
Modifier and Type | Method and Description |
---|---|
void |
Move.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
IfFoodAhead.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
Left.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
Progn4.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
Right.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
Progn3.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
Progn2.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
Move.evalPrint(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem,
int[][] map2)
Just like eval, but it retraces the map and prints out info
|
void |
IfFoodAhead.evalPrint(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem,
int[][] map2) |
void |
Left.evalPrint(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem,
int[][] map2) |
void |
Progn4.evalPrint(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem,
int[][] map2) |
void |
Right.evalPrint(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem,
int[][] map2) |
void |
EvalPrint.evalPrint(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem,
int[][] map2) |
void |
Progn3.evalPrint(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem,
int[][] map2) |
void |
Progn2.evalPrint(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem,
int[][] map2) |
Modifier and Type | Class and Description |
---|---|
class |
BBOBenchmarks
The Black Box Optimization workshop (BBOB) has an annual competition for doing real-valued parameter optimization.
|
Modifier and Type | Class and Description |
---|---|
class |
CartPole |
Modifier and Type | Class and Description |
---|---|
class |
CompetitiveMaxOnes |
Modifier and Type | Class and Description |
---|---|
class |
CoevolutionaryECSuite |
Modifier and Type | Class and Description |
---|---|
class |
ECSuite
Several standard Evolutionary Computation functions are implemented.
|
Modifier and Type | Class and Description |
---|---|
class |
Edge
Edge implements the Symbolic Edge problem.
|
Modifier and Type | Method and Description |
---|---|
void |
Loop.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
BAccept.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
BLoop.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
Epsilon.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
Zero.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
One.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
Double.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
BBud.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
Accept.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
Start.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
BStart.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
Reverse.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
Bud.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
Split.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
Modifier and Type | Class and Description |
---|---|
class |
Semantic
Implements Goldberg and O'Reilly's semantic Order and Majority
problems.
|
Modifier and Type | Method and Description |
---|---|
void |
SemanticNode.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
Modifier and Type | Class and Description |
---|---|
class |
HIFF
HIFF implements the Hierarchical If-And-Only-If problem developed by Watson, Hornby and Pollack.
|
Modifier and Type | Class and Description |
---|---|
class |
HighDimension |
Modifier and Type | Class and Description |
---|---|
class |
KLandscapes
KLandscapes implements the K-Landscapes problem of Vanneschi,
Castelli and Manzoni.
|
Modifier and Type | Method and Description |
---|---|
void |
KLandscapeTree.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
Modifier and Type | Class and Description |
---|---|
class |
KnapsackProblem
Definition of a basic knapsack problem.
|
Modifier and Type | Class and Description |
---|---|
class |
Lawnmower
Lawnmower implements the Koza-II Lawnmower problem.
|
Modifier and Type | Method and Description |
---|---|
void |
Left.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
Mow.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
Frog.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
LawnERC.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
Progn2.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
V8a.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
Modifier and Type | Class and Description |
---|---|
class |
Lid
Lid implements Daida's Lid problem.
|
Modifier and Type | Method and Description |
---|---|
void |
LidJ.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
LidX.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
Modifier and Type | Class and Description |
---|---|
class |
MajorityGA
MajorityGA.java
Implements a GA-style vector rule for the one-dimensional Majority-Ones cellular automaton problem.
|
class |
MajorityGP
MajorityGP.java
Implements a GP-style vector rule for the one-dimensional Majority-Ones cellular automaton problem.
|
Modifier and Type | Method and Description |
---|---|
void |
Or.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
X.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
WWW.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
EE.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
If.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
Nand.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
Not.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
Xor.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
And.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
Nor.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
E.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
EEE.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
WW.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
W.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
Modifier and Type | Class and Description |
---|---|
class |
Mona |
Modifier and Type | Class and Description |
---|---|
class |
MooSuite
Several standard Multi-objective benchmarks are implemented:
ZDT1: Zitzler, Deb & Thiele
ZDT2: Zitzler, Deb & Thiele
ZDT3: Zitzler, Deb & Thiele
ZDT4: Zitzler, Deb & Thiele
ZDT6: Zitzler, Deb & Thiele
SPHERE: ftp.tik.ee.ethz.ch/pub/people/zitzler/ZLT2001a.pdf
SCH: (Schaffer), (a.k.a.
|
Modifier and Type | Class and Description |
---|---|
class |
Multiplexer
Multiplexer implements the family of n-Multiplexer problems.
|
Modifier and Type | Method and Description |
---|---|
void |
D4.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
Or.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
If.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
Not.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
A2.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
D5.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
D2.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
And.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
D3.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
D0.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
D1.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
A1.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
D6.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
D7.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
A0.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
Modifier and Type | Method and Description |
---|---|
void |
D4.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
Or.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
If.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
Not.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
A2.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
D5.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
D2.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
And.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
D3.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
D0.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
D1.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
A1.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
D6.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
D7.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
A0.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
Modifier and Type | Class and Description |
---|---|
class |
NK
NK implmements the NK-landscape developed by Stuart Kauffman (in the book The Origins of
Order: Self-Organization and Selection in Evolution).
|
Modifier and Type | Class and Description |
---|---|
class |
OrderTree
OrderTree implements the OrderTree problem of Hoang et al.
|
Modifier and Type | Method and Description |
---|---|
void |
OrderTreeNode.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
Modifier and Type | Class and Description |
---|---|
class |
Parity
Parity implements the family of n-[even|odd]-Parity problems up
to 32-parity.
|
Modifier and Type | Method and Description |
---|---|
void |
D4.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
Or.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
D21.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
D8.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
D17.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
D16.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
D9.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
D20.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
Nand.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
D5.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
D11.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
D2.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
D31.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
D27.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
D26.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
D30.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
And.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
Nor.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
D3.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
D10.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
D29.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
D13.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
D25.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
D0.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
D1.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
D24.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
D12.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
D28.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
D23.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
D19.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
D6.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
D15.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
D14.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
D7.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
D18.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
D22.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
Modifier and Type | Class and Description |
---|---|
class |
Benchmarks
Benchmarks by various people in the literature.
|
class |
Quintic
Quintic implements a Symbolic Regression problem.
|
class |
Regression
Regression implements the Koza (quartic) Symbolic Regression problem.
|
class |
Sextic
Sextic implements a Symbolic Regression problem.
|
Modifier and Type | Method and Description |
---|---|
void |
Sin.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
Tan.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
X.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
Square.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
X3.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
X2.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
Cube.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
X5.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
VladERCB.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
Log.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
Inv.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
Sub.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
X4.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
VladERCC.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
Div.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
Tanh.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
Exp.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
Sqrt.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
Add.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
VladERCA.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
Neg.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
Cos.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
X1.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
RegERC.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
Mul.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
NegExp.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
Modifier and Type | Class and Description |
---|---|
class |
RoyalTree
RoyalTree implements Punch's RoyalTree problem.
|
Modifier and Type | Method and Description |
---|---|
void |
RoyalTreeNode.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
Modifier and Type | Class and Description |
---|---|
class |
SAT
SAT implements the boolean satisfiability problem.
|
Modifier and Type | Class and Description |
---|---|
class |
Singular |
Modifier and Type | Class and Description |
---|---|
class |
Sum
Sum is a simple example of the ec.Vector package, implementing the
very simple sum problem (fitness = sum over vector).
|
Modifier and Type | Class and Description |
---|---|
class |
TSPProblem
Implements a Traveling Salesmen Problem loaded from a file.
|
Modifier and Type | Class and Description |
---|---|
class |
MaxOnes |
Modifier and Type | Class and Description |
---|---|
class |
AddSubtract |
Modifier and Type | Class and Description |
---|---|
class |
OddRosenbrock |
Modifier and Type | Class and Description |
---|---|
class |
MultiValuedRegression |
Modifier and Type | Method and Description |
---|---|
void |
X.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
Y.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
Sub.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
Add.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
Mul.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
Modifier and Type | Class and Description |
---|---|
class |
TwoBox
TwoBox implements the TwoBox problem, with or without ADFs,
as discussed in Koza-II.
|
Modifier and Type | Method and Description |
---|---|
void |
L0.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
W0.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
H1.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
H0.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
W1.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
L1.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
Sub.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
Div.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
Add.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
Mul.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
Modifier and Type | Class and Description |
---|---|
class |
XOR |
Modifier and Type | Class and Description |
---|---|
class |
MasterProblem
MasterProblem.java
|
class |
MetaProblem
MetaProblem is a special class for implenting so-called "Meta-Evolutionary Algorithms",
a topic related to "HyperHeuristics".
|
Modifier and Type | Field and Description |
---|---|
Problem |
MasterProblem.problem |
Modifier and Type | Class and Description |
---|---|
class |
GPProblem
A GPProblem is a Problem which is meant to efficiently handle GP
evaluation.
|
Modifier and Type | Method and Description |
---|---|
void |
ADM.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
abstract void |
GPNode.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem)
Evaluates the node with the given thread, state, individual, problem, and stack.
|
void |
ADF.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
ADFArgument.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
ADFContext.evaluate(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem,
int argument)
Evaluates the argument number in the current context
|
Modifier and Type | Class and Description |
---|---|
class |
GEProblem
GEProblem is a special replacement for Problem which performs GE mapping.
|
Modifier and Type | Class and Description |
---|---|
class |
PushProblem
A PushProblem contains useful methods to help you create an
interpreter, write out the ECJ GP tree to a string, build a Push Program
around this string, load the interpreter with all your custom instructions,
and run the Push Program on the interpreter.
|
Modifier and Type | Method and Description |
---|---|
void |
Terminal.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
void |
Nonterminal.eval(EvolutionState state,
int thread,
GPData input,
ADFStack stack,
GPIndividual individual,
Problem problem) |
Copyright © 2019. All rights reserved.