Author： Tarrant Finbarr Bridge Derek
Publisher： Springer Publishing Company
ISSN： 0269-2821
Source： Artificial Intelligence Review, Vol.24, Iss.3-4, 2005-11, pp. : 455-476
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Dynamic algorithms for classes of constraint satisfaction problems
By Frigioni D. Marchetti-Spaccamela A. Nanni U.
Theoretical Computer Science, Vol. 259, Iss. 1, 2001-05 ,pp. :
Access to resources
Recommend
On the Hamming distance of constraint satisfaction problems
Theoretical Computer Science, Vol. 288, Iss. 1, 2002-10 ,pp. :
Fast Theta-Subsumption with Constraint Satisfaction Algorithms
Machine Learning, Vol. 55, Iss. 2, 2004-05 ,pp. :
Periodic Constraint Satisfaction Problems: Tractable Subclasses
By Chen Hubie
Constraints, Vol. 10, Iss. 2, 2005-04 ,pp. :