285 search results - page 1 / 57 » The complexity of soft constraint satisfaction |
AI
2006
Springer
13 years 11 months ago
2006
Springer
Over the past few years there has been considerable progress in methods to systematically analyse the complexity of constraint satisfaction problems with specified constraint type...
CCIA
2007
Springer
14 years 5 months ago
2007
Springer
With the arrival of high throughput genotyping techniques, the detection of likely genotyping errors is becoming an increasingly important problem. In this paper we are interested...
CONSTRAINTS
2008
13 years 11 months ago
2008
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
EUSFLAT
2009
13 years 8 months ago
2009
Harmonization with four voices is a musical problem which is subject to hard constraints, which absolutely need to be fulfilled, as well as to soft constraints, which preferably ho...
AAAI
2010
14 years 9 days ago
2010
