{"title":"Analysis of implicit parallelism in evolutionary algorithms: a stochastic version","authors":"Ding Lixin, Kang Lishan","doi":"10.1109/ICCIMA.2001.970463","DOIUrl":null,"url":null,"abstract":"Implicit parallelism in evolutionary algorithms is discussed. Under the condition of sampling populations with equal probability, an accurate expression of the expected number of different schemata processed by the evolutionary algorithms in each generation is obtained. Moreover, some kinds of the upper and lower bounds of the expected number are estimated.","PeriodicalId":232504,"journal":{"name":"Proceedings Fourth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2001","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Fourth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2001","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCIMA.2001.970463","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
Implicit parallelism in evolutionary algorithms is discussed. Under the condition of sampling populations with equal probability, an accurate expression of the expected number of different schemata processed by the evolutionary algorithms in each generation is obtained. Moreover, some kinds of the upper and lower bounds of the expected number are estimated.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
