2398 search results - page 189 / 480 » Constraint Programming and Graph Algorithms |
212
click to vote
PPOPP
1991
ACM
15 years 10 months ago
1991
ACM
This paper presents Jade, a language which allows a programmer to easily express dynamic coarse-grain parallelism. Starting with a sequential program, a programmer augments those ...
153
click to vote
CP
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. Most previous theoretical study of the complexity of the constraint satisfaction problem has considered a simplified version of the problem in which all variables have t...
152
click to vote
AAAI
2007
15 years 8 months ago
2007
We present a general framework for determining the number of solutions of constraint satisfaction problems (CSPs) with a high precision. Our first strategy uses additional binary...
203
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
This paper presents an algorithm for recovering the globally optimal 2D human figure detection using a loopy graph model. This is computationally challenging because the time comp...
278
click to vote
CP
2009
Springer
16 years 7 months ago
2009
Springer
The Valued Constraint Satisfaction Problem (VCSP) is a general framework encompassing many optimisation problems. We discuss precisely what it means for a problem to be modelled in...