1264 search results - page 48 / 253 » The framework approach for constraint satisfaction |
161
click to vote
TIP
2002
15 years 5 months ago
2002
In this paper, we present a general framework for image restoration; despite its simplicity, certain variational and certain wavelet approaches can be formulated within this framew...
132
click to vote
CP
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. The Quasigroup Completion Problem (QCP) is a very challenging benchmark among combinatorial problems, and the focus of much recent interest in the area of constraint prog...
162
Voted
FOCS
2007
IEEE
16 years 14 days ago
2007
IEEE
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...
180
click to vote
FOCI
2007
IEEE
16 years 14 days ago
2007
IEEE
— The Constraint Satisfaction Problem (CSP) is one of the most prominent problems in artificial intelligence, logic, theoretical computer science, engineering and many other are...
147
click to vote
ATAL
2003
Springer
15 years 11 months ago
2003
Springer
Managers of systems of shared resources typically have many separate goals. Examples are efficient utilization of the resources among its users and ensuring no user’s satisfacti...