711 search results - page 14 / 143 » Amalgams of Constraint Satisfaction Problems |
110
click to vote
ICALP
2007
Springer
15 years 5 months ago
2007
Springer
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
75
Voted
AAAI
1998
15 years 1 months ago
1998
In [4], Freuderdefines several types of interchangeability to capture the equivalenceamongthe valuesof a variable in a discrete constraint satisfaction problem(CSP), and provides ...
LICS
2006
IEEE
15 years 5 months ago
2006
IEEE
Abstract. We describe simple algebraic and combinatorial characterisations of finite relational core structures admitting finitely many obstructions. As a consequence, we show th...
121
click to vote
TEC
2002
14 years 11 months ago
2002
In this paper, we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to us...
92
Voted
APIN
2006
14 years 11 months ago
2006
The core issue of analogical reasoning is the transfer of relational knowledge from a source case to a target problem. Visual analogical reasoning pertains to problems containing ...