Fast Generation of Big Random Binary Trees

2020/01/13 by William B. Langdon, Langdon, William B.
Computer Science · #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Neural and Evolutionary Computing (cs.NE) #cs.DS #cs.NE

paper · pdf · doi:10.48550/arxiv.2001.04505

C++ code: http://www.cs.ucl.ac.uk/staff/W.Langdon/ftp/gp-code/rand_tree.cc_r1.43

arxiv created 2020/01/13 · arxiv updated 2020/01/15

Abstract

random_tree() is a linear time and space C++ implementation able to create trees of up to a billion nodes for genetic programming and genetic improvement experiments. A 3.60GHz CPU can generate more than 18 million random nodes for GP program trees per second.

Related

• ranger: A Fast Implementation of Random Forests for High Dimensional Data in C++ and R
• Faster Genetic Programming GPquick via multicore and Advanced Vector Extensions
• Parallel Galton Watson Process
• Massively Parallel Construction of Radix Tree Forests for the Efficient Sampling of Discrete Probability Distributions
• clrng: A tool set for parallel random numbergeneration on GPUs in R