198 search results - page 4 / 40 » Colouring, constraint satisfaction, and complexity |
COCO
2004
Springer
14 years 3 months 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...
CCIA
2007
Springer
14 years 4 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...
ISAAC
2005
Springer
14 years 3 months ago
2005
Springer
CP
2003
Springer
14 years 3 months ago
2003
Springer
Abstract. This paper offers a critique of the framework of Constraint Satisfaction Problems. While this framework has been successful in studying search techniques, and has inspire...
AI
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. Variables and constraints in problem domains are often distributed. These distributed constraint satisfaction problems (DCSPs) lend themselves to multiagent solutions. Mo...