约束满足的并行路径一致性算法

[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91 Pub Date : 1991-11-10 DOI:10.1109/TAI.1991.167040

Somnuk Keretho, R. Loganantharaj, V. Gudivada

{"title":"约束满足的并行路径一致性算法","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":"{\"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}","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

摘要

作者先前(1991)提出了一个O(n/sup 3/)路径一致性算法，它需要O(n/sup 2/)空间，而其他已知的O(n/sup 3/)时间复杂度算法需要O(n/sup 3/)空间。他们使用这个算法作为并行版本的主要框架。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Parallel path-consistency algorithms for constraint satisfaction

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.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91

自引率

0.00%

发文量