Sciweavers

1453 search results - page 2 / 291
» Partial Constraint Satisfaction
Sort
View
SETN
2004
Springer
13 years 11 months ago
Inherent Choice in the Search Space of Constraint Satisfaction Problem Instances
Abstract. Constructive methods obtain solutions to constraint satisfaction problem instances by iteratively extending consistent partial assignments. In this research, we study the...
George Boukeas, Panagiotis Stamatopoulos, Constant...
CP
2001
Springer
13 years 10 months ago
Partially Ordered Constraint Optimization Problems
The Constraint Problems usually addressed fall into one of two models: the Constraint Satisfaction Problem (CSP) and the Constraint Optimization Problem (COP). However, in many rea...
Marco Gavanelli
CSCLP
2006
Springer
13 years 9 months ago
Extracting Microstructure in Binary Constraint Networks
Abstract. We present algorithms that perform the extraction of partial assignments from binary Constraint Satisfaction Problems without introducing new constraints. They are based ...
Chavalit Likitvivatanavong, Roland H. C. Yap
AAAI
2007
13 years 8 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...
AMAI
2004
Springer
13 years 11 months ago
Symmetry Breaking in Constraint Satisfaction with Graph-Isomorphism: Comma-Free Codes
In this paper the use of graph isomorphism is investigated within the framework of symmetry breaking in constraint satisfaction problems. A running example of Comma-free codes is ...
Justin Pearson