1300 search results - page 5 / 260 » Constraint satisfaction problems and global cardinality cons... |
228
click to vote
CP
1995
Springer
15 years 9 months ago
1995
Springer
A distributed constraint satisfaction problem (Distributed CSP) is a CSP in which variables and constraints are distributed among multiple automated agents, and various application...
151
click to vote
SARA
2005
Springer
15 years 11 months ago
2005
Springer
This paper reconsiders the problems of discovering symmetries in constraint satisfaction problems (CSPs). It proposes a compositional approach which derives symmetries of the appli...
189
click to vote
LICS
2010
IEEE
15 years 4 months ago
2010
IEEE
We define tree automata with global constraints (TAGC), generalizing the well-known class of tree automata with global equality and disequality constraints [14] (TAGED). TAGC can...
170
click to vote
JCP
2006
15 years 6 months ago
2006
Finding a maximum cardinality matching in a graph is a problem appearing in numerous settings. The problem asks for a set of edges of maximum cardinality, such that no two edges of...
199
click to vote
HEURISTICS
2006
15 years 6 months ago
2006
In case a CSP is over-constrained, it is natural to allow some constraints, called soft constraints, to be violated. We propose a generic method to soften global constraints that c...