1381 search results - page 64 / 277 » Computational Complexity of Constraint Satisfaction |
118
Voted
RE
2010
Springer
14 years 10 months ago
2010
Springer
Self-adaptation is imposing as a key characteristic of many modern software systems to tackle their complexity and cope with the many environments in which they can operate. Self-a...
139
click to vote
AAAI
2000
15 years 5 months ago
2000
Recent work has demonstrated that treating resource reasoning separately from causal reasoning can lead to improved planning performance and rational resource management where inc...
136
click to vote
APPROX
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX k-CSP(P)). We show that if the set of assignments accepted by P co...
132
click to vote
CP
2007
Springer
15 years 10 months ago
2007
Springer
It has recently been shown, for the Constraint Satisfaction Problem (CSP), that the state associated with a node of the search tree built by a backtracking algorithm can be exploit...
156
click to vote
CP
2011
Springer
14 years 3 months ago
2011
Springer
A depth-first search algorithm can be used to find optimal solutions of a Constraint Satisfaction Problem (CSP) with respect to a set of conditional preferences statements (e.g.,...