Interleaving solving and elicitation of constraint satisfaction problems based on expected cost

ISSN： 1383-7133

Source： Constraints, Vol.15, Iss.4, 2010-10, pp. : 540-573

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

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

USING CASE-BASED TECHNIQUES TO ENHANCE CONSTRAINT SATISFACTION PROBLEM SOLVING

By Huang Ye Miles Roger

Applied Artificial Intelligence, Vol. 10, Iss. 4, 1996-07 ,pp. : 307-328

Taylor & Francis Ltd

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

Solving subgraph isomorphism problems with constraint programming

By Zampelli Stéphane

Constraints, Vol. 15, Iss. 3, 2010-07 ,pp. : 327-353

Springer Publishing Company

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