An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection
The complexity of any optimisation problem depends critically on the form of the objective function. Valued constraint satisfaction problems are discrete optimisation problems where the function to be minimised is given as a sum of cost functions de ned on speci ed subsets of variables. These cost f...
| Hoofdauteurs: | , , , |
|---|---|
| Formaat: | Report |
| Gepubliceerd in: |
OUCL
2010
|