24 search results - page 3 / 5 » Domain Filtering can Degrade Intelligent Backtracking Search |
CP
2000
Springer
14 years 2 days ago
2000
Springer
Abstract. Among backtracking based algorithms for constraint satisfaction problems (CSPs), algorithms employing constraint propagation, like forward checking (FC) and MAC, have had...
CP
2010
Springer
13 years 6 months ago
2010
Springer
Given an arbitrary constraint c on n variables with domain size d, we show how to generate a custom propagator that establishes GAC in time O(nd) by precomputing the propagation th...
CP
2007
Springer
14 years 1 months ago
2007
Springer
It has recently been shown, for the Constraint Satisfaction Problem (CSP), that the state associated with a node of the search tree built by a backtracking algorithm can be exploit...
AAAI
1994
13 years 9 months ago
1994
We present a new property called constraint looseness and show how it can be used to estimate the level of local consistency of a binary constraint network. Speci cally, we presen...
AMAI
2000
Springer
13 years 11 months ago
2000
Springer
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Comp...