makeTinyGpSearchHeuristic: Tiny GP Search Heuristic for RGP
In rgp: R genetic programming framework
Description
Usage
Arguments
Value
View source: R/search_heuristics.r
Description
The search-heuristic, i.e. the concrete GP search algorithm, is a modular component of RGP.
makeTinyGpSearchHeuristic creates an RGP search-heuristic that mimics the search heuristic
implemented in Riccardo Poli's TinyGP system.
Usage
1
makeTinyGpSearchHeuristic(crossoverProbability = 0.9, tournamentSize = 2)
Arguments
crossoverProbability
The crossover probability for search-heuristics that support
this setting (i.e. TinyGP). Defaults to 0.9.
tournamentSize
The size of TinyGP's selection tournaments.
Value
An RGP search heuristic.
rgp documentation built on May 30, 2017, 12:45 a.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Description Usage Arguments Value
View source: R/search_heuristics.r
Description
The search-heuristic, i.e. the concrete GP search algorithm, is a modular component of RGP.
makeTinyGpSearchHeuristic creates an RGP search-heuristic that mimics the search heuristic
implemented in Riccardo Poli's TinyGP system.
Usage
1 | makeTinyGpSearchHeuristic(crossoverProbability = 0.9, tournamentSize = 2)
|
Arguments
crossoverProbability |
The crossover probability for search-heuristics that support
this setting (i.e. TinyGP). Defaults to |
tournamentSize |
The size of TinyGP's selection tournaments. |
Value
An RGP search heuristic.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.