Evolution of Sorting Algorithm using Graph Structured Program Evolution

Created by W.Langdon from gp-bibliography.bib Revision:1.8129

@InProceedings{Shirakawa:2007:SMC,

• author = "Shinichi Shirakawa and Tomoharu Nagao",
• title = "Evolution of Sorting Algorithm using Graph Structured Program Evolution",
• booktitle = "Proceedings of the 2007 IEEE International Conference on Systems, Man and Cybernetics (SMC 2007)",
• year = "2007",
• pages = "1256--1261",
• address = "Montreal, Canada",
• month = oct # " 7-10",
• publisher = "IEEE",
• keywords = "genetic algorithms, genetic programming, automatic programming, directed graphs, program control structures, software maintenance, sorting, GRAPE representation, automatic programming, directed graph, graph structured program, evolution, integer linear string, program branches, program loops, sorting algorithm evolution",
• DOI = "doi:10.1109/ICSMC.2007.4413828",
• size = "6 pages",
• abstract = "In this paper, we apply graph structured program evolution (GRAPE) to evolution of general sorting algorithm. GRAPE is a new Automatic Programming technique. The representation of GRAPE is graph structure, therefore it can express complex programs (e.g. branches and loops) using its graph structure. Each program is constructed as an arbitrary directed graph of nodes and data set. GRAPE handles multiple data types using data set for each type, and the genotype of GRAPE is the form of a linear string of integers. The aim of this work is to evolve a program which correctly sort any sequence of numbers. We demonstrate that GRAPE constructs general sorting algorithm automatically.",
• notes = "Also known as \cite{4413828}",

}

Genetic Programming entries for Shinichi Shirakawa Tomoharu Nagao

Citations