566 search results - page 6 / 114 » Solution Reuse in Dynamic Constraint Satisfaction Problems |
ECAI
2004
Springer
15 years 5 months ago
2004
Springer
Super solutions are a mechanism to provide robustness to constraint programs [10]. They are solutions in which, if a small number of variables lose their values, we are guaranteed ...
118
click to vote
FLAIRS
2004
15 years 1 months ago
2004
The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, mu...
102
click to vote
AAAI
1997
15 years 1 months ago
1997
Cooperative distributed problem solving (CDPS) loosely-coupledagentscan be effectively modeledas a distributed constraint satisfaction problem(DCSP) whereeach agent has multiple l...
IROS
2006
IEEE
15 years 6 months ago
2006
IEEE
— The accelerations of and forces among contacting rigid bodies may be computed by formulating the dynamics equations and contact constraints as a complementarity problem [1]. Da...
108
click to vote
CSCLP
2006
Springer
15 years 3 months ago
2006
Springer
A number of different satisfaction and optimisation combinatorial problems have recently been approached with constraint programming over the domain of finite sets, for increased d...