417 search results - page 47 / 84 » In Search of the Best Constraint Satisfaction Search |
MOZ
2004
Springer
15 years 3 months ago
2004
Springer
ional Abstractions for Search Factories Guido Tack, Didier Le Botlan MOZ 2004 Presented at International Mozart/Oz Conference (MOZ 2004) Charleroi, Belgium October 2004 Published i...
CONSTRAINTS
2006
14 years 9 months ago
2006
Covering arrays can be applied to the testing of software, hardware and advanced materials, and to the effects of hormone interaction on gene expression. In this paper we develop c...
CPAIOR
2007
Springer
15 years 4 months ago
2007
Springer
The Open-Shop Problem is a hard problem that can be solved using Constraint Programming or Operation Research methods. Existing techniques are efficient at reducing the search tree...
SARA
2009
Springer
15 years 4 months ago
2009
Springer
Constraint Programming is an attractive approach for solving AI planning problems by modelling them as Constraint Satisfaction Problems (CSPs). However, formulating effective cons...
CONSTRAINTS
2002
14 years 9 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...