Fast Theta-Subsumption with Constraint Satisfaction Algorithms

ISSN： 0885-6125

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

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

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

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. : 287-305

Elsevier

Access to resources Recommend Favorite

Toward A Constraint-Satisfaction Framework for Evaluating Program-Understanding Algorithms

By Quilici A.

Automated Software Engineering, Vol. 4, Iss. 3, 1997-07 ,pp. : 271-289

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

A Glimpse of Constraint Satisfaction

By Tsang E.

Artificial Intelligence Review, Vol. 13, Iss. 3, 1999-06 ,pp. : 215-227

Springer Publishing Company

Access to resources Recommend Favorite