1968 search results - page 44 / 394 » The Complexity of Valued Constraint Models |
100
click to vote
MOBICOM
2005
ACM
15 years 7 months ago
2005
ACM
This paper is a contribution to the generic problem of having simple and accurate models to dimension radio cells with data traffic on a GPRS or EDGE network. It addresses the iss...
138
click to vote
CSR
2007
Springer
15 years 7 months ago
2007
Springer
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
112
click to vote
SMI
2006
IEEE
15 years 7 months ago
2006
IEEE
In this paper, we propose a constrained least squares approach for stably computing Laplacian deformation with strict positional constraints. In the existing work on Laplacian def...
134
click to vote
WETICE
1996
IEEE
15 years 5 months ago
1996
IEEE
Communication and coordination play an important role in achieving concurrency in the design of large complex artifacts. It is also widely accepted that design is constraint orien...
119
click to vote
ICCV
2011
IEEE
14 years 1 months ago
2011
IEEE
Many state-of-the-art segmentation algorithms rely on Markov or Conditional Random Field models designed to enforce spatial and global consistency constraints. This is often accom...