1381 search results - page 73 / 277 » Computational Complexity of Constraint Satisfaction |
126
click to vote
MFCS
2010
Springer
15 years 2 months ago
2010
Springer
For a finite set Γ of Boolean relations, Max Ones SAT(Γ) and Exact Ones SAT(Γ) are generalized satisfiability problems where every constraint relation is from Γ, and the task...
133
click to vote
ICRA
2010
IEEE
15 years 2 months ago
2010
IEEE
— Classically, the inverse kinematics is performed by computing the singular value decomposition of the matrix to invert. This enables a very simple writing of the algorithm. How...
139
click to vote
ICCV
2011
IEEE
14 years 4 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...
153
click to vote
CONSTRAINTS
2006
15 years 4 months ago
2006
Abstract. Constraint Programming (CP) offers a rich modeling language of constraints embedding efficient algorithms to handle complex and heterogeneous combinatorial problems. To s...
155
click to vote
ICS
2010
Tsinghua U.
16 years 1 months ago
2010
Tsinghua U.
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A ...