314 search results - page 21 / 63 » A non-binary constraint ordering heuristic for constraint sa... |
CP
2007
Springer
14 years 1 months ago
2007
Springer
Ordering heuristics are a powerful tool in CSP search algorithms. Among the most successful ordering heuristics are heuristics which enforce a fail first strategy by using the mi...
CONSTRAINTS
2002
13 years 7 months ago
2002
In this paper, we report the design and implementation of a constraint-based interactive train rescheduling tool, a project in collaboration with the International Institute for So...
CP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Constraint Programming is a proven successful technique, but it requires skill in modeling problems, and knowledge on how algorithms interact with models. What can be a g...
SARA
2009
Springer
14 years 2 months ago
2009
Springer
Classical planning deals with finding a (shortest) sequence of actions transferring the world from its initial state to a state satisfying the goal condition. Traditional planning...
SARA
2007
Springer
14 years 1 months ago
2007
Springer
In order to apply constraint programming to a particular domain, the problem must first be modelled as a constraint satisfaction problem. There are typically many alternative mode...