711 search results - page 57 / 143 » Amalgams of Constraint Satisfaction Problems |
124
Voted
ICTAI
2006
IEEE
15 years 10 months ago
2006
IEEE
Traditional global search heuristics to solve constraint satisfaction problems focus on properties of an individual variable that mandate early search attention. If, however, one ...
128
click to vote
CP
2005
Springer
15 years 10 months ago
2005
Springer
Conditional symmetry arises in a sub-problem of a constraint satisfaction problem, where the sub-problem satisfies some condition under which additional symetries hold. Typically...
145
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. We describe decomposition during search (DDS), an integration of And/Or tree search into propagation-based constraint solvers. The presented search algorithm dynamically ...
119
click to vote
CP
2008
Springer
15 years 6 months ago
2008
Springer
Submodular constraints play an important role both in theory and practice of valued constraint satisfaction problems (VCSPs). It has previously been shown, using results from the ...
117
click to vote
ICCBR
2003
Springer
15 years 9 months ago
2003
Springer
In [1] we propose interchangeability based algorithms as methods for solving the case adaptation for the domain of problems which can be expressed as Constraint Satisfaction Proble...