Sciweavers

7 search results - page 1 / 2
» Transposition Tables for Constraint Satisfaction
Sort
View
AAAI
2007
13 years 7 months ago
Transposition Tables for Constraint Satisfaction
In this paper, a state-based approach for the Constraint Satisfaction Problem (CSP) is proposed. The key novelty is an original use of state memorization during search to prevent ...
Christophe Lecoutre, Lakhdar Sais, Sébastie...
CP
2007
Springer
13 years 10 months ago
Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance
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...
Christophe Lecoutre, Lakhdar Sais, Sébastie...
IJCAI
1997
13 years 6 months ago
Constraint Satisfaction over Connected Row Convex Constraints
This paper studies constraint satisfaction over connected row-convex (CRC) constraints. It shows that CRC constraints are closed under composition, intersection, and transposition...
Yves Deville, Olivier Barette, Pascal Van Hentenry...
STACS
2009
Springer
13 years 11 months ago
Tractable Structures for Constraint Satisfaction with Truth Tables
The way the graph structure of the constraints influences the complexity of constraint satisfaction problems (CSP) is well understood for bounded-arity constraints. The situation...
Dániel Marx
KBS
2007
75views more  KBS 2007»
13 years 4 months ago
Managing restaurant tables using constraints
Restaurant table management can have significant impact on both profitability and the customer experience. The core of the issue is a complex dynamic combinatorial problem. We sho...
Alfio Vidotto, Kenneth N. Brown, J. Christopher Be...