314 search results - page 44 / 63 » A non-binary constraint ordering heuristic for constraint sa... |
AIR
2004
13 years 7 months ago
2004
Abstract. In this work we study an over-constrained scheduling problem where constraints cannot be relaxed. This problem originates from a local defense agency where activities to ...
CP
2009
Springer
14 years 2 months ago
2009
Springer
This paper describes a new approach for solving disjunctive temporal problems such as the open shop and job shop scheduling domains. Much previous research in systematic search app...
IJCAI
2003
13 years 9 months ago
2003
Temporal Constraint Satisfaction Problems allow for reasoning with events happening over time. Their expressiveness has been extended independently in two directions: to account f...
CP
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. In the last decades, the Satisfiability and Constraint Satisfaction Problem frameworks were extended to integrate aspects such as uncertainties, partial observabilities, ...
HEURISTICS
2010
13 years 5 months ago
2010
This paper investigates an adaptive constructive method for solving nurse rostering problems. The constraints considered in the problems are categorised into three classes: those t...