Solving finite domain constraint hierarchies by local consistency and tree search

ISSN： 1362-3079

Source： Journal of Experimental & Theoretical Artificial Intelligence, Vol.21, Iss.4, 2009-12, pp. : 233-257

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 hierarchies of finite-domain constraints

By Wolf Armin

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

Taylor & Francis Ltd

Access to resources Recommend Favorite

From local to global consistency in temporal constraint networks

By Koubarakis M.

Theoretical Computer Science, Vol. 173, Iss. 1, 1997-02 ,pp. : 89-112

Elsevier

Access to resources Recommend Favorite

Model-driven visualizations of constraint-based local search

By Dooms Grégoire Hentenryck Pascal Michel Laurent

Constraints, Vol. 14, Iss. 3, 2009-09 ,pp. : 294-324

Springer Publishing Company

Access to resources Recommend Favorite

Solving a chemical batch scheduling problem by local search

By Brucker Peter Hurink Johann

Annals of Operations Research, Vol. 96, Iss. 1-4, 2000-11 ,pp. : 17-38

Springer Publishing Company

Access to resources Recommend Favorite

Introduction to the Special Issue on Local Search Techniques in Constraint Satisfaction

By Naveh Yehuda Roli Andrea

Constraints, Vol. 12, Iss. 3, 2007-09 ,pp. : 261-262

Springer Publishing Company

Access to resources Recommend Favorite