1381 search results - page 56 / 277 » Computational Complexity of Constraint Satisfaction |
132
Voted
SCP
1998
15 years 3 months ago
1998
Consistency techniques are an e cient way of tackling constraint satisfaction problems (CSP). In particular, various arc-consistency algorithms have been designed such as the time...
128
Voted
ER
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We investigate the computational complexity of reasoning over temporal extensions of conceptual data models. The temporal conceptual models we analyse include the standar...
111
Voted
LICS
2006
IEEE
15 years 10 months ago
2006
IEEE
Constraint languages that arise from finite algebras have recently been the object of study, especially in connection with the Dichotomy Conjecture of Feder and Vardi. An importa...
133
click to vote
CP
2006
Springer
15 years 7 months ago
2006
Springer
Distributed computing is increasingly important at a time when the doubling of the number of transistors on a processor every 18 months no longer translates in a doubling of speed ...
127
click to vote
ATAL
2006
Springer
15 years 7 months ago
2006
Springer
Distributed Constraint Satisfaction Problems (DCSPs) provide a model to capture a broad range of cooperative multiagent problem solving settings. Researchers have generally propos...