711 search results - page 50 / 143 » Amalgams of Constraint Satisfaction Problems |
175
click to vote
ICTAI
2009
IEEE
15 years 2 months ago
2009
IEEE
We propose a new method for solving structured CSPs which generalizes and improves the Cyclic-Clustering approach [4]. First, the cutset and the tree-decomposition of the constrai...
153
click to vote
CSCLP
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. We present algorithms that perform the extraction of partial assignments from binary Constraint Satisfaction Problems without introducing new constraints. They are based ...
118
click to vote
CP
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. Researchers have focused on assessing the quality of search algorithms by measuring effort, number of mistakes, runtime distributions and other characteristics. In this p...
126
click to vote
ACG
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Kakuro consists in filling a grid with integers that sum up to predefined values. Sums are predefined for each row and column and all integers have to be different in ...
119
click to vote
FLAIRS
2004
15 years 5 months ago
2004
The integration of methods of Constraint Programming and Multi-Agent-Systems is discussed in this paper. We describe different agent topologies for Constraint Satisfaction Problem...