A new and efficient partitioning algorithm: genetic partitioning

L.-M. Jin, S.-P. Chan
{"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}
引用次数: 3

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.<>
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种新的高效分区算法:遗传分区
利用遗传算法,提出了一种新的高效分区算法——遗传分区。遗传划分具有(1)相对于最优解爬坡的能力和(2)由于遗传算法固有的群体而隐式并行处理的能力。检查两个电路。与穷举搜索方法相比,第一种电路的结果在85%的情况下是最优的。遗传分配在速度上与模拟退火具有竞争力,这已被第二电路所证实
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Linville power plane stability and bandwidth improvements in a minimum-drift video amplifier Computer-aided large-signal analysis-and-control of boost converter-based switching regulators A SPICE macromodel for an adjustable positive voltage regulator An algorithm for lossless transmission line analysis using bounce charts Application of digital microprocessor technology to power metering in the presence of harmonics
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1