DocumentCode :
2389026
Title :
Parallel path-consistency algorithms for constraint satisfaction
Author :
Keretho, S. ; Loganantharaj, R. ; Gudivada, V.N.
Author_Institution :
Center for Adv. Comput. Studies, Southwestern Louisiana Univ., Lafayette, LA, USA
fYear :
1991
fDate :
10-13 Nov 1991
Firstpage :
516
Lastpage :
517
Abstract :
The authors previously proposed (1991) a O(n3) path-consistency algorithm which requires O(n2) space, whereas other known O(n3) time complexity algorithms need O (n3) space. They use this algorithm as the main framework for a parallel version
Keywords :
artificial intelligence; computational complexity; parallel algorithms; constraint satisfaction; parallel path consistency algorithms; time complexity algorithms; Algebra; Artificial intelligence; Computer science; Concurrent computing; Hardware; Parallel algorithms; Parallel processing; Polynomials;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Tools for Artificial Intelligence, 1991. TAI '91., Third International Conference on
Conference_Location :
San Jose, CA
Print_ISBN :
0-8186-2300-4
Type :
conf
DOI :
10.1109/TAI.1991.167040
Filename :
167040
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=2389026
بازگشت