{"title":"可满足性问题的外显子和内含子遗传算法","authors":"V. Popov","doi":"10.12988/ASTP.2013.13034","DOIUrl":null,"url":null,"abstract":"In this paper we propose a new model of genetic algorithms. This model uses notions of exons and introns. We consider the satisfiability problem as a testbed for a genetic algorithm with exons and introns.","PeriodicalId":127314,"journal":{"name":"Advanced Studies in Theoretical Physics","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"Genetic algorithms with exons and introns for the satisfiability problem\",\"authors\":\"V. Popov\",\"doi\":\"10.12988/ASTP.2013.13034\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we propose a new model of genetic algorithms. This model uses notions of exons and introns. We consider the satisfiability problem as a testbed for a genetic algorithm with exons and introns.\",\"PeriodicalId\":127314,\"journal\":{\"name\":\"Advanced Studies in Theoretical Physics\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Advanced Studies in Theoretical Physics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.12988/ASTP.2013.13034\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Advanced Studies in Theoretical Physics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.12988/ASTP.2013.13034","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Genetic algorithms with exons and introns for the satisfiability problem
In this paper we propose a new model of genetic algorithms. This model uses notions of exons and introns. We consider the satisfiability problem as a testbed for a genetic algorithm with exons and introns.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
