Genetic network programming with automatically generated variable size macro nodes

Nakagoe, Hiroshi; Hirasawa, K.; Hu, Jingle

doi:10.1109/cec.2004.1330929

Cited by 3 publications

(2 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Initially, we set the size of the input list (the list length) for data[0] to data [4], a constant value of 0 for data [5] to data [9], and a constant value of 1 for data [10] to data [14]. The node functions used in this experiment are { +, −, * , /, =, >, <, SwapList, EqualList, GreaterList, LessList, OutputList } from Table 2.…”

Section: List Sortingmentioning

confidence: 99%

See 1 more Smart Citation

Graph structured program evolution with automatically defined nodes

Shirakawa

Nagao

2009

Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation

View full text Add to dashboard Cite

Currently, various automatic programming techniques have been proposed and applied in various fields. Graph Structured Program Evolution (GRAPE) is a recent automatic programming technique with graph structure. This technique can generate complex programs automatically. In this paper, we introduce the concept of automatically defined functions, called automatically defined nodes (ADN), in GRAPE. The proposed GRAPE program has a main program and several subprograms. We verified the effectiveness of ADN through several program evolution experiments, and report the results of evolution of recursive programs using GRAPE modified with ADN.

show abstract

Section: List Sortingmentioning

confidence: 99%

“…Embedded CGP [20,21] is a method in which CGP is implemented as ADFs by automatically acquiring and evolving modules. GNP also has an ADF-like mechanism, called automatically generated macro nodes (AGM) [10]. These AGMs have network structures and are evolved like the main GNP.…”

Section: Introductionmentioning

confidence: 99%