Cartesian Genetic Programming
Cartesian Genetic Programming is a form of genetic programming that represents programs as directed acyclic graphs arranged in a grid-like Cartesian coordinate system, where nodes correspond to functions and edges represent data flow, differing from traditional tree-based representations by enabling non-linear, modular, and compact encodings.
128
Publications
5.3K
Citations
171
Authors
81
Institutions
Publications per year
2017–2026
41
Variants
Cgp
Parents
128
1–5 of 128
171
20
h-index
13
h-index
University of Engineering and Technology Peshawar, Pakistan
14 publications · 467 citations
12
h-index
12
h-index
10
h-index
1–5 of 171
81

University of York
York, United Kingdom
22 h-index
66 publications
3K citations
Brno University of Technology
Brno, Czechia
13 h-index
40 publications
1.5K citations
University of Engineering and Technology Peshawar
Peshawar, Pakistan
12 h-index
30 publications
1K citations
Memorial University of Newfoundland
St. John's, Canada
8 h-index
16 publications
533 citations
Dalle Molle Institute for Artificial Intelligence Research
Lugano, Switzerland
5 h-index
16 publications
324 citations
Johannes Gutenberg University Mainz
Mainz, Germany
4 h-index
3 publications
62 citations
TU Dortmund University
Dortmund, Germany
4 h-index
4 publications
77 citations

University of Salerno
Fisciano, Italy
3 h-index
10 publications
366 citations
1–8 of 81
11 publications · 421 citations
11
h-index
5 publications · 627 citations
5
h-index
3 publications · 234 citations
4
h-index
2 publications · 26 citations
3
h-index
2 publications · 30 citations
2
h-index
1–5