{"title":"基于移动的多路划分算法的评价","authors":"Elie Yarack, J. Carletta","doi":"10.1109/ICCD.2000.878309","DOIUrl":null,"url":null,"abstract":"This paper presents a thorough analytical and experimental comparison of four move-based multi-way partitioning algorithms. Modifications are considered to the algorithm with the best solution quality, partitioning by free moves. These modifications allow a tradeoff to be made between solution quality and execution time. Results are given for ISCAS and other benchmarks.","PeriodicalId":437697,"journal":{"name":"Proceedings 2000 International Conference on Computer Design","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"An evaluation of move-based multi-way partitioning algorithms\",\"authors\":\"Elie Yarack, J. Carletta\",\"doi\":\"10.1109/ICCD.2000.878309\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a thorough analytical and experimental comparison of four move-based multi-way partitioning algorithms. Modifications are considered to the algorithm with the best solution quality, partitioning by free moves. These modifications allow a tradeoff to be made between solution quality and execution time. Results are given for ISCAS and other benchmarks.\",\"PeriodicalId\":437697,\"journal\":{\"name\":\"Proceedings 2000 International Conference on Computer Design\",\"volume\":\"40 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-09-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 2000 International Conference on Computer Design\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCD.2000.878309\",\"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 2000 International Conference on Computer Design","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCD.2000.878309","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An evaluation of move-based multi-way partitioning algorithms
This paper presents a thorough analytical and experimental comparison of four move-based multi-way partitioning algorithms. Modifications are considered to the algorithm with the best solution quality, partitioning by free moves. These modifications allow a tradeoff to be made between solution quality and execution time. Results are given for ISCAS and other benchmarks.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
