566 search results - page 64 / 114 » Solution Reuse in Dynamic Constraint Satisfaction Problems |
106
click to vote
SAC
2009
ACM
15 years 11 months ago
2009
ACM
In this work, our objective is to heuristically discover a simplified form of functional dependencies between variables called weak dependencies. Once discovered, these relations...
150
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 ...
125
click to vote
SETN
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. In order to obtain a solution to a constraint satisfaction problem, constructive methods iteratively extend a consistent partial assignment until all problem variables ar...
130
click to vote
AAAI
1996
15 years 5 months ago
1996
Constraint satisfaction consistency preprocessing methods are used to reduce search e ort. Time and especially space costs limit the amount of preprocessing that will be cost e ec...
110
click to vote
GECCO
2004
Springer
15 years 9 months ago
2004
Springer
The optimization of the epoxy polymerization process involves a number of conflicting objectives and more than twenty decision parameters. In this paper, the problem is treated tr...