Optimal population sizes in GPU genetic programming vary by problem, favoring either small deep searches or very large broad searches, with stepped sizes offering a balance.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.NE 2verdicts
UNVERDICTED 2representative citing papers
Provides C++ code snippets for multi-core parallel memory-efficient crossover in generational genetic programming, limiting active individuals to M + 2*nthreads.
citing papers explorer
-
The Effects of Population Size on the Performance of BEAGLE GPU-Based Genetic Programming Runs
Optimal population sizes in GPU genetic programming vary by problem, favoring either small deep searches or very large broad searches, with stepped sizes offering a balance.
-
Multi-threaded Memory Efficient Crossover in C++ for Generational Genetic Programming
Provides C++ code snippets for multi-core parallel memory-efficient crossover in generational genetic programming, limiting active individuals to M + 2*nthreads.