7092 search results - page 746 / 1419 » Parallelizing constraint programs |
198
click to vote
ICML
2008
IEEE
16 years 8 months ago
2008
IEEE
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
292
click to vote
CP
2009
Springer
16 years 7 months ago
2009
Springer
This paper deals with the challenging problem of counting the number of solutions of a CSP, denoted #CSP. Recent progress have been made using search methods, such as BTD [15], whi...
219
click to vote
STOC
2006
ACM
16 years 7 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 ...
168
click to vote
SAC
2010
ACM
16 years 2 months ago
2010
ACM
We consider the design of parametric curves from geometric constraints such as distance from lines or points and tangency to lines or circles. We solve the Hermite problem with su...
193
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...