99 search results - page 13 / 20 » Search Techniques for Non-linear Constraint Satisfaction Pro... |
SGAI
2007
Springer
14 years 25 days ago
2007
Springer
Constraint Satisfaction Problems can be solved using either iterative improvement or constructive search approaches. Iterative improvement techniques converge quicker than the cons...
CP
2008
Springer
13 years 8 months ago
2008
Springer
Backbone variables have the same assignment in all solutions to a given constraint satisfaction problem; more generally, bias represents the proportion of solutions that assign a v...
KR
1992
Springer
13 years 10 months ago
1992
Springer
This paper studies a version of the job shop scheduling problem in which some operations have to be scheduled within non-relaxable time windows i.e. earliest latest possible start...
CP
2003
Springer
13 years 12 months ago
2003
Springer
Symmetry in a Constraint Satisfaction Problem can cause wasted search, which can be avoided by adding constraints to the CSP to exclude symmetric assignments or by modifying the s...
FLAIRS
2004
13 years 8 months ago
2004
Constraint satisfaction technology emerged from AI research. Its practical success is based on integration of sophisticated search with consistency techniques reducing the search ...