Pub Date : 2021-07-13DOI: 10.1007/s10710-021-09407-7
R. Harper
{"title":"Introducing Design Automation for Quantum Computing, Alwin Zulehner and Robert Wille. ISBN 978-3-030-41753-6, 2020, Springer International Publishing. 222 Pages, 51 b/w illustrations, 14 illustrations in colour","authors":"R. Harper","doi":"10.1007/s10710-021-09407-7","DOIUrl":"https://doi.org/10.1007/s10710-021-09407-7","url":null,"abstract":"","PeriodicalId":50424,"journal":{"name":"Genetic Programming and Evolvable Machines","volume":"22 1","pages":"387 - 389"},"PeriodicalIF":2.6,"publicationDate":"2021-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10710-021-09407-7","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43339921","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-05-25DOI: 10.1007/s10710-021-09415-7
L. Mariot, S. Picek, D. Jakobović, A. Leporati
{"title":"Evolutionary algorithms for designing reversible cellular automata","authors":"L. Mariot, S. Picek, D. Jakobović, A. Leporati","doi":"10.1007/s10710-021-09415-7","DOIUrl":"https://doi.org/10.1007/s10710-021-09415-7","url":null,"abstract":"","PeriodicalId":50424,"journal":{"name":"Genetic Programming and Evolvable Machines","volume":"22 1","pages":"429 - 461"},"PeriodicalIF":2.6,"publicationDate":"2021-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43023333","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-04-23DOI: 10.1007/s10710-021-09403-x
S. Mauceri, James Sweeney, Miguel Nicolau, James McDermott
{"title":"Feature extraction by grammatical evolution for one-class time series classification","authors":"S. Mauceri, James Sweeney, Miguel Nicolau, James McDermott","doi":"10.1007/s10710-021-09403-x","DOIUrl":"https://doi.org/10.1007/s10710-021-09403-x","url":null,"abstract":"","PeriodicalId":50424,"journal":{"name":"Genetic Programming and Evolvable Machines","volume":"22 1","pages":"267 - 295"},"PeriodicalIF":2.6,"publicationDate":"2021-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10710-021-09403-x","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45059659","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-03-22DOI: 10.1007/s10710-021-09402-y
M. Roshanzamir, M. Palhang, Abdolreza Mirzaei
{"title":"Efficiency improvement of genetic network programming by tasks decomposition in different types of environments","authors":"M. Roshanzamir, M. Palhang, Abdolreza Mirzaei","doi":"10.1007/s10710-021-09402-y","DOIUrl":"https://doi.org/10.1007/s10710-021-09402-y","url":null,"abstract":"","PeriodicalId":50424,"journal":{"name":"Genetic Programming and Evolvable Machines","volume":"22 1","pages":"229 - 266"},"PeriodicalIF":2.6,"publicationDate":"2021-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10710-021-09402-y","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45856172","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-03-19DOI: 10.21203/RS.3.RS-342085/V1
R. Nieto-Fuentes, C. Segura
The proper management of diversity is essential to the success of Evolutionary Algorithms. Specifically, methods that explicitly relate the amount of diversity maintained in the population to the stopping criterion and elapsed period of execution, with the aim of attaining a gradual shift from exploration to exploitation, have been particularly successful. However, in the area of Genetic Programming, the performance of this design principle has not been studied. In this paper, a novel Genetic Programming method, Genetic Programming with Dynamic Management of Diversity (GP-DMD), is presented. GP-DMD applies this design principle through a replacement strategy that combines penalties based on distance-like functions with a multi-objective Pareto selection based on accuracy and simplicity. The proposed general method was adapted to the well-established Symbolic Regression benchmark problem using tree-based Genetic Programming. Several state-of-the-art diversity management approaches were considered for the experimental validation, and the results obtained showcase the improvements both in terms of mean square error and size. The effects of GP-DMD on the dynamics of the population are also analyzed, revealing the reasons for its superiority. As in other fields of Evolutionary Computation, this design principle contributes significantly to the area of Genetic Programming.
{"title":"GP-DMD: a genetic programming variant with dynamic management of diversity","authors":"R. Nieto-Fuentes, C. Segura","doi":"10.21203/RS.3.RS-342085/V1","DOIUrl":"https://doi.org/10.21203/RS.3.RS-342085/V1","url":null,"abstract":"The proper management of diversity is essential to the success of Evolutionary Algorithms. Specifically, methods that explicitly relate the amount of diversity maintained in the population to the stopping criterion and elapsed period of execution, with the aim of attaining a gradual shift from exploration to exploitation, have been particularly successful. However, in the area of Genetic Programming, the performance of this design principle has not been studied. In this paper, a novel Genetic Programming method, Genetic Programming with Dynamic Management of Diversity (GP-DMD), is presented. GP-DMD applies this design principle through a replacement strategy that combines penalties based on distance-like functions with a multi-objective Pareto selection based on accuracy and simplicity. The proposed general method was adapted to the well-established Symbolic Regression benchmark problem using tree-based Genetic Programming. Several state-of-the-art diversity management approaches were considered for the experimental validation, and the results obtained showcase the improvements both in terms of mean square error and size. The effects of GP-DMD on the dynamics of the population are also analyzed, revealing the reasons for its superiority. As in other fields of Evolutionary Computation, this design principle contributes significantly to the area of Genetic Programming.","PeriodicalId":50424,"journal":{"name":"Genetic Programming and Evolvable Machines","volume":"1 1","pages":"1-26"},"PeriodicalIF":2.6,"publicationDate":"2021-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47261037","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：