GOLEM can potentially work with different kinds of graph: Trees, Dags, Cyclic graphs etc. Each kind implies appropriate mutations/crossovers/verification rules. Currently user must know about this and specify it himself.
The idea is automate it using single meta-parameter, that specifies what we evolve and chooses group of appropriate linked operators and rules.
GOLEM can potentially work with different kinds of graph: Trees, Dags, Cyclic graphs etc. Each kind implies appropriate mutations/crossovers/verification rules. Currently user must know about this and specify it himself.
The idea is automate it using single meta-parameter, that specifies what we evolve and chooses group of appropriate linked operators and rules.