749 search results - page 63 / 150 » Dualities for Constraint Satisfaction Problems |
124
click to vote
FLAIRS
2006
15 years 5 months ago
2006
Because many real-world problems can be represented and solved as constraint satisfaction problems, the development of effective, efficient constraint solvers is important. A solv...
121
click to vote
FLAIRS
2007
15 years 6 months ago
2007
We deal with the search process of the GraphPlan algorithm in this paper. We concentrate on a problem of finding supports for a sub-goal which arises during the search. We model t...
124
click to vote
SBACPAD
2003
IEEE
15 years 9 months ago
2003
IEEE
— Scheduling by Edge Reversal (SER) is a fully distributed scheduling mechanism based on the manipulation of acyclic orientations of a graph. This work uses SER to perform constr...
121
click to vote
CPAIOR
2004
Springer
15 years 9 months ago
2004
Springer
To improve solution robustness, we introduce the concept of super solutions to constraint programming. An (a, b)-super solution is one in which if a variables lose their values, th...
151
click to vote
CDC
2010
IEEE
14 years 11 months ago
2010
IEEE
We consider a multi-agent optimization problem where agents aim to cooperatively minimize a sum of local objective functions subject to a global inequality constraint and a global ...