并行快速凌乱遗传算法的细粒度和构建块大小分析

Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600) Pub Date : 2002-05-12 DOI:10.1109/CEC.2002.1006221

R. O. Day, J. Zydallis, G. Lamont, R. Pachter

{"title":"并行快速凌乱遗传算法的细粒度和构建块大小分析","authors":"R. O. Day, J. Zydallis, G. Lamont, R. Pachter","doi":"10.1109/CEC.2002.1006221","DOIUrl":null,"url":null,"abstract":"This paper presents two methods designed to improve the efficiency and effectiveness of the parallel fast messy GA used in solving the Protein Structure Prediction (PSP) problem. The first is an application of a farming model - targeting algorithm efficiency. The second successful method addresses the building block sizes used in the algorithm - targeting algorithm effectiveness.","PeriodicalId":184547,"journal":{"name":"Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Analysis of fine granularity and building block sizes in the parallel fast messy GA\",\"authors\":\"R. O. Day, J. Zydallis, G. Lamont, R. Pachter\",\"doi\":\"10.1109/CEC.2002.1006221\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents two methods designed to improve the efficiency and effectiveness of the parallel fast messy GA used in solving the Protein Structure Prediction (PSP) problem. The first is an application of a farming model - targeting algorithm efficiency. The second successful method addresses the building block sizes used in the algorithm - targeting algorithm effectiveness.\",\"PeriodicalId\":184547,\"journal\":{\"name\":\"Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600)\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-05-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CEC.2002.1006221\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEC.2002.1006221","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

本文提出了两种提高并行快速混沌遗传算法求解蛋白质结构预测(PSP)问题的效率和有效性的方法。首先是一个农业模型的应用-目标算法效率。第二种成功的方法解决了算法中使用的构建块大小-目标算法的有效性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Analysis of fine granularity and building block sizes in the parallel fast messy GA

This paper presents two methods designed to improve the efficiency and effectiveness of the parallel fast messy GA used in solving the Protein Structure Prediction (PSP) problem. The first is an application of a farming model - targeting algorithm efficiency. The second successful method addresses the building block sizes used in the algorithm - targeting algorithm effectiveness.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600)

自引率

0.00%

发文量