preprint Open access

Fast Generation of Big Random Binary Trees

  • arXiv (Cornell University)
  • Cornell University
Research footprint

At a glance

Citations
4
References
16
Comments
0
Paper overview

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.

Record transparency

Publication details

DOI
10.48550/arxiv.2001.04505
OpenAlex
W2999380746
Document type
preprint
Language
EN
Source
arXiv (Cornell University)
Last metadata update
Community

Comments

Log in to join the discussion.

  1. No comments yet. Start the discussion.