ホウチン テルヒサ
Teruhisa Hochin
寶珍 輝尚 所属 追手門学院大学 理工学部 情報工学科 職種 教授 |
|
言語種別 | 英語 |
発行・発表の年月 | 2012 |
形態種別 | 論文 |
査読 | 査読あり |
標題 | Concurrency control program generation by decreasing nodes of program trees in genetic programming |
執筆形態 | 共著・編著(代表編著を除く) |
掲載誌名 | Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics |
掲載区分 | 国外 |
出版社・発行元 | IEEE |
巻・号・頁 | 2012 Vol.2,pp.1023-1028 |
著者・共著者 | Shinji Tamura,Teruhisa Hochin,Hiroki Nomiya |
概要 | 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. © 2012 IEEE. |
DOI | 10.1109/ICSMC.2012.6377863 |
ISSN | 1062-922X |
DBLP ID | conf/smc/TamuraHN12 |
PermalinkURL | https://dblp.uni-trier.de/rec/conf/smc/2012 |
researchmap用URL | https://dblp.uni-trier.de/db/conf/smc/smc2012.html#TamuraHN12 |