{"title":"Parallel path-consistency algorithms for constraint satisfaction","authors":"Somnuk Keretho, R. Loganantharaj, V. Gudivada","doi":"10.1109/TAI.1991.167040","DOIUrl":null,"url":null,"abstract":"The authors previously proposed (1991) a O(n/sup 3/) path-consistency algorithm which requires O(n/sup 2/) space, whereas other known O(n/sup 3/) time complexity algorithms need O(n/sup 3/) space. They use this algorithm as the main framework for a parallel version.<<ETX>>","PeriodicalId":371778,"journal":{"name":"[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91","volume":"31 10","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TAI.1991.167040","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7
Abstract
The authors previously proposed (1991) a O(n/sup 3/) path-consistency algorithm which requires O(n/sup 2/) space, whereas other known O(n/sup 3/) time complexity algorithms need O(n/sup 3/) space. They use this algorithm as the main framework for a parallel version.<>
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
![[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91](/Content/css/sci/img/zetp.jpg)
求助内容：
应助结果提醒方式：
扫码关注我们
