Genetic programming: on the programming of computers by means of natural selection
Genetic programming: on the programming of computers by means of natural selection
Genetic programming II: automatic discovery of reusable programs
Genetic programming II: automatic discovery of reusable programs
Parallel distributed genetic programming
New ideas in optimization
Proceedings of the European Conference on Genetic Programming
Linear-Tree GP and Its Comparison with Other GP Structures
EuroGP '01 Proceedings of the 4th European Conference on Genetic Programming
Linear-Graph GP - A New GP Structure
EuroGP '02 Proceedings of the 5th European Conference on Genetic Programming
PADO: Learning Tree Structured Algorithms for Orchestration into an Object Recognition System
PADO: Learning Tree Structured Algorithms for Orchestration into an Object Recognition System
Design of combinational logic circuits through an evolutionary multiobjective optimization approach
Artificial Intelligence for Engineering Design, Analysis and Manufacturing
| Hi-index | 0.00 |
This paper describes Multiple Interactive Outputs in a Single Tree (MIOST), a new form of Genetic Programming (GP). Our approach is based on two ideas. Firstly, we have taken inspiration from graph-GP representations. With this idea we decided to explore the possibility of representing programs as graphs with oriented links. Secondly, our individuals could have more than one output. This idea was inspired on the divide and conquer principle, a program is decomposed in subprograms, and so, we are expecting to make the original problem easier by breaking down a problem into two or more sub-problems. To verify the effectiveness of our approach, we have used several evolvable hardware problems of different complexity taken from the literature. Our results indicate that our approach has a better overall performance in terms of consistency to reach feasible solutions.