Sciweavers

4426 search results - page 571 / 886
» Concurrent Constraint Programming
Sort
View
CP
2009
Springer
16 years 7 months ago
Exploiting Problem Structure for Solution Counting
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...
Aurélie Favier, Philippe Jégou, Simo...
PODC
2009
ACM
16 years 7 months ago
Distributed and parallel algorithms for weighted vertex cover and other covering problems
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...
Christos Koufogiannakis, Neal E. Young
STOC
2006
ACM
132views Algorithms» more  STOC 2006»
16 years 7 months ago
Near-optimal algorithms for unique games
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 ...
Moses Charikar, Konstantin Makarychev, Yury Makary...
SAC
2010
ACM
16 years 1 months ago
Constraint-based LN-curves
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...
Young Joon Ahn, Christoph M. Hoffmann
ESTIMEDIA
2009
Springer
16 years 1 months ago
The wizard of OS: a heartbeat for Legacy multimedia applications
—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...
Tommaso Cucinotta, Luca Abeni, Luigi Palopoli, Fab...