285 search results - page 25 / 57 » The complexity of soft constraint satisfaction |
CP
2004
Springer
15 years 5 months ago
2004
Springer
Constraint programming is rapidly becoming the technology of choice for modeling and solving complex combinatorial problems. However, users of constraint programming technology nee...
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
The fundamental problem of our interest is soft MIMO detection for the case of block fading, i.e., when the transmitted codeword spans over several independent channel realization...
CP
2005
Springer
15 years 5 months ago
2005
Springer
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). The general CSP is known to be NP-complete; however, distributed m...
IJCAI
2001
15 years 1 months ago
2001
The algorithm presented here, BCC, is an enhancement of the well known Backtrack used to solve constraint satisfaction problems. Though most backtrack improvements rely on propaga...
105
click to vote
FORMATS
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. We consider temporal logic formulae specifying constraints in continuous time and space on the behaviors of continuous and hybrid dynamical system admitting uncertain par...