99 search results - page 8 / 20 » Search Techniques for Non-linear Constraint Satisfaction Pro... |
PUK
2001
13 years 8 months ago
2001
Combination of AI/OR methods is gaining a great deal of attention because many combinatorial problems especially in planning and scheduling areas can be solved by means of combined...
CP
2004
Springer
14 years 3 days ago
2004
Springer
Abstract. One of the most appealing features of constraint programming is its rich constraint language for expressing combinatorial optimization problems. This paper demonstrates t...
AI
1999
Springer
13 years 6 months ago
1999
Springer
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...
CP
2004
Springer
14 years 3 days ago
2004
Springer
Constraint programming is rapidly becoming the technology of choice for modeling and solving complex combinatorial problems. However, users of constraint programming technology nee...
AISC
2004
Springer
14 years 3 days ago
2004
Springer
Symmetry-breaking in constraint satisfaction problems (CSPs) is a well-established area of AI research which has recently developed strong interactions with symbolic computation, i...