Concurrency control program generation by decreasing nodes of program trees in genetic programming

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

@InProceedings{Tamura:2012:SMC,

• author = "Shinji Tamura and Teruhisa Hochin and Hiroki Nomiya",
• booktitle = "IEEE International Conference on Systems, Man, and Cybernetics (SMC 2012)",
• title = "Concurrency control program generation by decreasing nodes of program trees in genetic programming",
• year = "2012",
• pages = "1023--1028",
• address = "Seoul",
• keywords = "genetic algorithms, genetic programming, concurrency control, database management systems, program compilers, trees (mathematics), automatic defined function, concurrency control program generation, high-level symbol set, program tree node decrease, tree representation, Conferences, Cybernetics, Decision support systems, concurrency control, granularity, program generation",
• isbn13 = "978-1-4673-1713-9",
• DOI = "doi:10.1109/ICSMC.2012.6377863",
• abstract = "This paper tries to generate an appropriate concurrency control program by using genetic programming (GP). In GP, a program is represented with a tree. Nodes of a tree are selected from a symbol set. This paper tries two symbol sets: the high-level symbol set and the reduced one. The high-level one includes high-level symbols created by combining conventional ones. In the reduced symbol set, symbols are drastically decreased by changing the method of implementing the concurrency control program. Automatic defined functions (ADFs) are also used. Introducing high-level symbols caused the increase of the number of symbols. This made the program generation difficult. On the other hand, an appropriate program could be generated with the reduced symbol set. An ADF is also used in the program generated.",
• notes = "Also known as \cite{6377863}",

}

Genetic Programming entries for Shinji Tamura Teruhisa Hochin Hiroki Nomiya

Citations