1381 search results - page 8 / 277 » Computational Complexity of Constraint Satisfaction |
COCO
2004
Springer
14 years 28 days ago
2004
Springer
We prove a parameterized analog of Schaefer’s Dichotomy Theorem: we show that for every finite boolean constraint family F, deciding whether a formula containing constraints fr...
ECAL
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. This paper proposes a computational model for solving optimisation problems that mimics the principle of evolutionary transitions in individual complexity. More specific...
CCIA
2007
Springer
14 years 1 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...
GECCO
2004
Springer
14 years 28 days ago
2004
Springer
We discuss the computational complexity of random 2D Ising spin glasses, which represent an interesting class of constraint satisfaction problems for black box optimization. Two ex...
ISAAC
2005
Springer
14 years 1 months ago
2005
Springer
