749 search results - page 97 / 150 » Dualities for Constraint Satisfaction Problems |
SAC
1994
ACM
15 years 3 months ago
1994
ACM
An extension of Me parallel constraint logic programming language ElipSys is presented. This extension is directed towards the development of multi-agent systems which have to dea...
EVOW
2005
Springer
15 years 4 months ago
2005
Springer
University Course Timetabling-Problems (UCTPs) involve the allocation of resources (such as rooms and timeslots) to all the events of a university, satisfying a set of hard-constra...
AIR
1999
14 years 10 months ago
1999
The timetabling problem consists in scheduling a sequence of lectures between teachers and students in a prefixed period of time (typically a week), satisfying a set of constraints...
FOCS
2007
IEEE
15 years 5 months 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 ...
CPAIOR
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. In this paper, we introduce a Yet ImprovEd Limited Discrepancy Search (YIELDS), a complete algorithm for solving Constraint Satisfaction Problems. As indicated in its nam...