42 search results - page 1 / 9 » Programmed Search in a Timetabling Problem over Finite Domai... |
ENTCS
2007
13 years 4 months ago
2007
PATAT
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Automated timetabling is a research domain that has occupied many researchers over the last 50 years. Several algorithms have proven to be applicable to timetabling but t...
LPNMR
2007
Springer
13 years 10 months ago
2007
Springer
Recent research in answer-set programming (ASP) is concerned with the problem of finding faithful transformations of logic programs under the stable semantics. This is in particul...
CP
2003
Springer
13 years 10 months ago
2003
Springer
We provide a reformulation of the constraint hierarchies (CHs) framework based on the notion of error indicators. Adapting the generalized view of local consistency in semiring-ba...
CSCLP
2006
Springer
13 years 8 months ago
2006
Springer
A number of different satisfaction and optimisation combinatorial problems have recently been approached with constraint programming over the domain of finite sets, for increased d...