{"title":"二元决策图快速优化的变量重排序方法","authors":"MoonBae Song, Hoon Chang","doi":"10.1109/ATS.1997.643963","DOIUrl":null,"url":null,"abstract":"In this paper, a new variable ordering algorithm, distributed reordering algorithm that allows more faster solution than existing ones, is presented. Since this method can accomplish fast optimization of BDD in less memory and computation time, the proposed algorithm is more efficient for dynamic variable ordering. Also, the proposed algorithm can achieve more optimized results in combining with other variable ordering method.","PeriodicalId":330767,"journal":{"name":"Proceedings Sixth Asian Test Symposium (ATS'97)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A variable reordering method for fast optimization of binary decision diagrams\",\"authors\":\"MoonBae Song, Hoon Chang\",\"doi\":\"10.1109/ATS.1997.643963\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, a new variable ordering algorithm, distributed reordering algorithm that allows more faster solution than existing ones, is presented. Since this method can accomplish fast optimization of BDD in less memory and computation time, the proposed algorithm is more efficient for dynamic variable ordering. Also, the proposed algorithm can achieve more optimized results in combining with other variable ordering method.\",\"PeriodicalId\":330767,\"journal\":{\"name\":\"Proceedings Sixth Asian Test Symposium (ATS'97)\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1997-11-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Sixth Asian Test Symposium (ATS'97)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ATS.1997.643963\",\"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 Sixth Asian Test Symposium (ATS'97)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ATS.1997.643963","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A variable reordering method for fast optimization of binary decision diagrams
In this paper, a new variable ordering algorithm, distributed reordering algorithm that allows more faster solution than existing ones, is presented. Since this method can accomplish fast optimization of BDD in less memory and computation time, the proposed algorithm is more efficient for dynamic variable ordering. Also, the proposed algorithm can achieve more optimized results in combining with other variable ordering method.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
