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. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Galván-López, E., & Rodríguez-Vázquez, K. (2007). Multiple interactive outputs in a single tree: An empirical investigation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4445 LNCS, pp. 341–350). Springer Verlag. https://doi.org/10.1007/978-3-540-71605-1_32
Mendeley helps you to discover research relevant for your work.