{"title":"聚乳酸最优折叠的分支定界算法","authors":"J. Lewandowski, C. Liu","doi":"10.1109/DAC.1984.1585832","DOIUrl":null,"url":null,"abstract":"In this paper we present a branch and bound algorithm which exhaustively searches for an optimal column and/or row folding of PLAs. For PLAs with up to 50-60 input/output lines we can obtain an optimal solution in no more than a few minutes.","PeriodicalId":188431,"journal":{"name":"21st Design Automation Conference Proceedings","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1984-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"22","resultStr":"{\"title\":\"A Branch and Bound Algorithm for Optimal PLA Folding\",\"authors\":\"J. Lewandowski, C. Liu\",\"doi\":\"10.1109/DAC.1984.1585832\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we present a branch and bound algorithm which exhaustively searches for an optimal column and/or row folding of PLAs. For PLAs with up to 50-60 input/output lines we can obtain an optimal solution in no more than a few minutes.\",\"PeriodicalId\":188431,\"journal\":{\"name\":\"21st Design Automation Conference Proceedings\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1984-06-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"22\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"21st Design Automation Conference Proceedings\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DAC.1984.1585832\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"21st Design Automation Conference Proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DAC.1984.1585832","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Branch and Bound Algorithm for Optimal PLA Folding
In this paper we present a branch and bound algorithm which exhaustively searches for an optimal column and/or row folding of PLAs. For PLAs with up to 50-60 input/output lines we can obtain an optimal solution in no more than a few minutes.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
