{"title":"一种新的高效分区算法:遗传分区","authors":"L.-M. Jin, S.-P. Chan","doi":"10.1109/MWSCAS.1991.252013","DOIUrl":null,"url":null,"abstract":"A novel and efficient partitioning algorithm, called genetic partitioning, utilizing genetic algorithms is presented. Genetic partitioning has the capability of (1) climbing uphill with respect to the best solution and (2) implicit parallel processing due to population inherent in genetic algorithms. Two circuits are examined. The results of the first circuit are optimal in 85% of the cases when compared with those obtained using the exhaustive search approach. Genetic partitioning is competitive with simulated annealing in speed, as verified by the second circuit.<<ETX>>","PeriodicalId":6453,"journal":{"name":"[1991] Proceedings of the 34th Midwest Symposium on Circuits and Systems","volume":"80 1","pages":"712-715 vol.2"},"PeriodicalIF":0.0000,"publicationDate":"1991-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A new and efficient partitioning algorithm: genetic partitioning\",\"authors\":\"L.-M. Jin, S.-P. Chan\",\"doi\":\"10.1109/MWSCAS.1991.252013\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A novel and efficient partitioning algorithm, called genetic partitioning, utilizing genetic algorithms is presented. Genetic partitioning has the capability of (1) climbing uphill with respect to the best solution and (2) implicit parallel processing due to population inherent in genetic algorithms. Two circuits are examined. The results of the first circuit are optimal in 85% of the cases when compared with those obtained using the exhaustive search approach. Genetic partitioning is competitive with simulated annealing in speed, as verified by the second circuit.<<ETX>>\",\"PeriodicalId\":6453,\"journal\":{\"name\":\"[1991] Proceedings of the 34th Midwest Symposium on Circuits and Systems\",\"volume\":\"80 1\",\"pages\":\"712-715 vol.2\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-05-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1991] Proceedings of the 34th Midwest Symposium on Circuits and Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MWSCAS.1991.252013\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1991] Proceedings of the 34th Midwest Symposium on Circuits and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MWSCAS.1991.252013","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A new and efficient partitioning algorithm: genetic partitioning
A novel and efficient partitioning algorithm, called genetic partitioning, utilizing genetic algorithms is presented. Genetic partitioning has the capability of (1) climbing uphill with respect to the best solution and (2) implicit parallel processing due to population inherent in genetic algorithms. Two circuits are examined. The results of the first circuit are optimal in 85% of the cases when compared with those obtained using the exhaustive search approach. Genetic partitioning is competitive with simulated annealing in speed, as verified by the second circuit.<>
![[1991] Proceedings of the 34th Midwest Symposium on Circuits and Systems](/Content/css/sci/img/zetp.jpg)
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
