749 search results - page 96 / 150 » Dualities for Constraint Satisfaction Problems |
161
click to vote
CONEXT
2010
ACM
15 years 3 months ago
2010
ACM
Traditional DSL troubleshooting solutions are reactive, relying mainly on customers to report problems, and tend to be labor-intensive, time consuming, prone to incorrect resoluti...
176
Voted
CDC
2010
IEEE
15 years 15 days ago
2010
IEEE
In this paper we study the constrained consensus problem, i.e. the problem of reaching a common point from the estimates generated by multiple agents that are constrained to lie in...
152
Voted
COMPULOG
1999
Springer
15 years 9 months ago
1999
Springer
Many constraint satisfaction problems can be naturally and efficiently modelled using non-binary constraints like the “all-different” and “global cardinality” constraints...
147
click to vote
HEURISTICS
2002
15 years 5 months ago
2002
This paper presents a heuristic algorithm for solving RCPSP/max, the resource constrained project scheduling problem with generalized precedence relations. The algorithm relies, a...
141
click to vote
CP
2003
Springer
15 years 10 months ago
2003
Springer
Symmetry in a Constraint Satisfaction Problem can cause wasted search, which can be avoided by adding constraints to the CSP to exclude symmetric assignments or by modifying the s...