{"title":"用抽象约简系统理论分析实验室分配算法的完备性","authors":"M. Noto, M. Kurihara, A. Ohuchi","doi":"10.1109/SICE.1995.526651","DOIUrl":null,"url":null,"abstract":"A laboratory assignment algorithm is a procedure that assigns each of the m students to one of the n laboratories. In this paper, we prove the completeness (i.e., termination and confluence) of the algorithm by using the abstract reduction systems theory. Termination guarantees that the computation will not proceed indefinitely, and confluence guarantees that the computational result is unique even in the presence of indeterminacy.","PeriodicalId":344374,"journal":{"name":"SICE '95. Proceedings of the 34th SICE Annual Conference. International Session Papers","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Analysis of completeness of laboratory assignment algorithm by abstract reduction systems theory\",\"authors\":\"M. Noto, M. Kurihara, A. Ohuchi\",\"doi\":\"10.1109/SICE.1995.526651\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A laboratory assignment algorithm is a procedure that assigns each of the m students to one of the n laboratories. In this paper, we prove the completeness (i.e., termination and confluence) of the algorithm by using the abstract reduction systems theory. Termination guarantees that the computation will not proceed indefinitely, and confluence guarantees that the computational result is unique even in the presence of indeterminacy.\",\"PeriodicalId\":344374,\"journal\":{\"name\":\"SICE '95. Proceedings of the 34th SICE Annual Conference. International Session Papers\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1995-07-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"SICE '95. Proceedings of the 34th SICE Annual Conference. International Session Papers\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SICE.1995.526651\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"SICE '95. Proceedings of the 34th SICE Annual Conference. International Session Papers","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SICE.1995.526651","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Analysis of completeness of laboratory assignment algorithm by abstract reduction systems theory
A laboratory assignment algorithm is a procedure that assigns each of the m students to one of the n laboratories. In this paper, we prove the completeness (i.e., termination and confluence) of the algorithm by using the abstract reduction systems theory. Termination guarantees that the computation will not proceed indefinitely, and confluence guarantees that the computational result is unique even in the presence of indeterminacy.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
