An interval partitioning algorithm for constraint satisfaction problems

Author： Pedamallu Chandra Sekhar   Kumar Arun   Csendes Tibor   Posfai Janos  

Publisher： Inderscience Publishers

ISSN： 1746-6172

Source： International Journal of Modelling, Identification and Control, Vol.14, Iss.1-2, 2011-09, pp. : 133-140

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

An Arc-Consistency Algorithm for Dynamic and Distributed Constraint Satisfaction Problems

By Ringwelski Georg  

Artificial Intelligence Review, Vol. 24, Iss. 3-4, 2005-11 ,pp. : 431-454

Springer Publishing Company

Access to resources Recommend Favorite

Solving Constraint-Satisfaction Problems by a Genetic Algorithm Adopting Viral Infection

By Kanoh H.   Matsumoto M.   Hasegawa K.   Kato N.   Nishihara S.  

Engineering Applications of Artificial Intelligence, Vol. 10, Iss. 6, 1997-12 ,pp. : 531-537

Elsevier

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

Periodic Constraint Satisfaction Problems: Tractable Subclasses

By Chen Hubie  

Constraints, Vol. 10, Iss. 2, 2005-04 ,pp. : 97-113

Springer Publishing Company

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