Shunichi Sugimoto, T. Hattori, T. Izumi, H. Kawano
{"title":"快速感性匹配法求解扩展稳定婚姻问题的一种算法","authors":"Shunichi Sugimoto, T. Hattori, T. Izumi, H. Kawano","doi":"10.1109/ICBAKE.2009.55","DOIUrl":null,"url":null,"abstract":"This paper proposes a fast iteration algorithm for Kansei matching as an algorithm for solving the general stable marriage problem, which is easier and more transparent than the conventional (extended) Gale-Shapley (GS) algorithm in the sense of programming and debugging. This paper also presents a fast version of the iteration algorithm and describes the result of comparative experimentation in execution time. The result shows that the proposed algorithm executes more than six times faster than the GS one, while it requires the same memory storage as GS one, and this proves the effectiveness of the iteration method.","PeriodicalId":137627,"journal":{"name":"2009 International Conference on Biometrics and Kansei Engineering","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Fast Kansei Matching Method as an Algorithm for the Solution of Extended Stable Marriage Problem\",\"authors\":\"Shunichi Sugimoto, T. Hattori, T. Izumi, H. Kawano\",\"doi\":\"10.1109/ICBAKE.2009.55\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes a fast iteration algorithm for Kansei matching as an algorithm for solving the general stable marriage problem, which is easier and more transparent than the conventional (extended) Gale-Shapley (GS) algorithm in the sense of programming and debugging. This paper also presents a fast version of the iteration algorithm and describes the result of comparative experimentation in execution time. The result shows that the proposed algorithm executes more than six times faster than the GS one, while it requires the same memory storage as GS one, and this proves the effectiveness of the iteration method.\",\"PeriodicalId\":137627,\"journal\":{\"name\":\"2009 International Conference on Biometrics and Kansei Engineering\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-06-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 International Conference on Biometrics and Kansei Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICBAKE.2009.55\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Conference on Biometrics and Kansei Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICBAKE.2009.55","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Fast Kansei Matching Method as an Algorithm for the Solution of Extended Stable Marriage Problem
This paper proposes a fast iteration algorithm for Kansei matching as an algorithm for solving the general stable marriage problem, which is easier and more transparent than the conventional (extended) Gale-Shapley (GS) algorithm in the sense of programming and debugging. This paper also presents a fast version of the iteration algorithm and describes the result of comparative experimentation in execution time. The result shows that the proposed algorithm executes more than six times faster than the GS one, while it requires the same memory storage as GS one, and this proves the effectiveness of the iteration method.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
