Decomposition techniques for parallel resolution of constraint satisfaction problems in shared memory: a comparative study

Author： Habbas Zineb   Krajecki Michael   Singer Daniel  

Publisher： Inderscience Publishers

ISSN： 1742-7185

Source： International Journal of Computational Science and Engineering, Vol.1, Iss.2-4, 2006-05, pp. : 192-206

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Fine-grained conflict resolution in constraint satisfaction problems

By Hower Walter   Jacobi Stephan  

Journal of Experimental & Theoretical Artificial Intelligence, Vol. 10, Iss. 1, 1998-01 ,pp. : 37-47

Taylor & Francis Ltd

Access to resources Recommend Favorite

Solution Techniques for Constraint Satisfaction Problems: Foundations

By Miguel I.   Shen Q.  

Artificial Intelligence Review, Vol. 15, Iss. 4, 2001-06 ,pp. : 243-267

Springer Publishing Company

Access to resources Recommend Favorite

Solution Techniques for Constraint Satisfaction Problems: Advanced Approaches

By Miguel I.   Shen Q.  

Artificial Intelligence Review, Vol. 15, Iss. 4, 2001-06 ,pp. : 269-293

Springer Publishing Company

Access to resources Recommend Favorite

On the Hamming distance of constraint satisfaction problems

By Crescenzi P.   Rossi G.  

Theoretical Computer Science, Vol. 288, Iss. 1, 2002-10 ,pp. : 85-100

Elsevier

Access to resources Recommend Favorite

Applying constraint satisfaction techniques to job shop scheduling

By Cheng C-C.   Smith S.F.  

Annals of Operations Research, Vol. 70, Iss. 1, 1997-01 ,pp. : 327-357

Springer Publishing Company

Access to resources Recommend Favorite