Dynamic algorithms for classes of constraint satisfaction problems

Author： Frigioni D.   Marchetti-Spaccamela A.   Nanni U.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.259, Iss.1, 2001-05, pp. : 287-305

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

Algorithms for Distributed Constraint Satisfaction: A Review

By Yokoo M.  

Autonomous Agents and Multi-Agent Systems, Vol. 3, Iss. 2, 2000-06 ,pp. : 185-207

Springer Publishing Company

Access to resources Recommend Favorite

When Ants Attack: Ant Algorithms for Constraint Satisfaction Problems: A short Exposition of the concept

By Tarrant Finbarr   Bridge Derek  

Artificial Intelligence Review, Vol. 24, Iss. 3-4, 2005-11 ,pp. : 455-476

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

Fast Theta-Subsumption with Constraint Satisfaction Algorithms

By Maloberti Jérôme  

Machine Learning, Vol. 55, Iss. 2, 2004-05 ,pp. : 137-174

Springer Publishing Company

Access to resources Recommend Favorite