30 search results - page 3 / 6 » A Tribute to Eugene Freuder |
CP
1999
Springer
13 years 9 months ago
1999
Springer
A lot of work in constraint satisfaction has been focused on finding solutions to difficult problems. Many real life problems however, while not extremely complicated, have a huge...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Substitutability, interchangeability and related concepts in Constraint Programming were introduced approximately twenty years ago and have given rise to considerable subsequent re...
CP
2004
Springer
13 years 10 months ago
2004
Springer
A constraint satisfaction problem (CSP) model can be preprocessed to ensure that any choices made will lead to solutions, without the need to backtrack. This can be especially usef...
CPAIOR
2004
Springer
13 years 10 months ago
2004
Springer
This paper addresses the question of selecting an algorithm from a predefined set that will have the best performance on a scheduling problem instance. Our goal is to reduce the e...
CP
2003
Springer
13 years 10 months ago
2003
Springer
Constraint programming is a technology which is now widely used to solve combinatorial problems in industrial applications. However, using it requires considerable knowledge and e...