4524 search results - page 140 / 905 » The Complexity of Global Constraints |
AAAI
2008
15 years 3 months ago
2008
Most former studies of Distributed Constraint Optimization Problems (DisCOPs) search considered only complete search algorithms, which are practical only for relatively small prob...
78
Voted
CP
2005
Springer
15 years 6 months ago
2005
Springer
In the context of previous work on redundant modeling, permutation problems and matrix modeling, we introduce the notion of partial redundant modeling and categorical channeling co...
113
click to vote
AAAI
2006
15 years 2 months ago
2006
Several methods for breaking value symmetries have been proposed recently in the constraint programming community. They can be used in conjunction with variable symmetry breaking ...
103
Voted
CORR
2008
Springer
15 years 25 days ago
2008
Springer
In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For suc...
114
click to vote
SLP
1994
15 years 2 months ago
1994
The design and implementation of constraint logic programming (CLP) languages over intervals is revisited. Instead of decomposing complex constraints in terms of simple primitive ...