2861 search results - page 312 / 573 » Constraint Programming |
204
click to vote
PODC
2009
ACM
16 years 7 months ago
2009
ACM
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
175
click to vote
ESTIMEDIA
2009
Springer
16 years 1 months ago
2009
Springer
—Multimedia applications are often characterised by implicit temporal constraints but, in many cases, they are not programmed using any specialised real-time API. These “Legacy...
185
click to vote
STOC
2006
ACM
16 years 6 months ago
2006
ACM
Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard to ...
156
click to vote
APLAS
2004
ACM
15 years 12 months ago
2004
ACM
Modular programming enjoys many well-known advantages: readability, maintainability, separate development and compilation. However, the composition of modular units (components) s...
167
click to vote
HM
2009
Springer
15 years 11 months ago
2009
Springer
We present a hybrid solver (called GELATO) that exploits the potentiality of a Constraint Programming (CP) environment (Gecode) and of a Local Search (LS) framework (EasyLocal++ )....