376 search results - page 76 / 76 » Solution Counting Algorithms for Constraint-Centered Search ... |
CP
2004
Springer
13 years 11 months ago
2004
Springer
This paper considers the problem of transforming a resource feasible, fixed-times schedule into a partial order schedule (POS) to enhance its robustness and stability properties. ...