Fast Generation of Big Random Binary Trees
Created by W.Langdon from
gp-bibliography.bib Revision:1.8081
- @TechReport{langdon:RN2001,
-
author = "William B. Langdon",
-
title = "Fast Generation of Big Random Binary Trees",
-
institution = "Computer Science, University College, London",
-
year = "2020",
-
number = "RN/20/01",
-
address = "Gower Street, London, UK",
-
month = "13 " # jan,
-
keywords = "genetic algorithms, genetic programming, gpquick",
-
URL = "https://arxiv.org/abs/2001.04505",
-
video_url = "https://youtu.be/Zcf9YYlZHsA",
-
size = "5 pages",
-
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.",
-
notes = "Enhance part of GPquick
Slides:
http://www.cs.ucl.ac.uk/staff/W.Langdon/gggp/bigtree/langdon_sse_15-jan-2020.pdf
C++ code:
http://www.cs.ucl.ac.uk/staff/W.Langdon/ftp/gp-code/rand_tree.cc_r1.43",
- }
Genetic Programming entries for
William B Langdon
Citations