As a guest user you are not logged in or recognized by your IP address. You have
access to the Front Matter, Abstracts, Author Index, Subject Index and the full
text of Open Access publications.
Constraint satisfaction problems are traditionally solved using some form of backtrack search that propagates constraints after each decision is made. The efficiency of search relies heavily on the use of good variable and value ordering heuristics. In this paper we show that constraints can also be used to guide the search process by actively proposing the next choice point to be branched on. We show that search effort can be reduced significantly.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.