714 search results - page 94 / 143 » Lexicographically-ordered constraint satisfaction problems |
EVOW
2005
Springer
14 years 3 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
13 years 9 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
14 years 4 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
14 years 4 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...
LICS
2006
IEEE
14 years 3 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...