18 search results - page 2 / 4 » Refining the Basic Constraint Propagation Algorithm |
EAAI
2008
13 years 7 months ago
2008
The criterion of total weighted completion time occurs as a sub-problem of combinatorial optimization problems in such diverse areas as scheduling, container loading and storage a...
GLOBECOM
2010
IEEE
13 years 4 months ago
2010
IEEE
Advance reservation of connection requests is a growing focus area and a range of solutions have been proposed. However, most efforts here have focused on scheduling algorithm desi...
CP
1999
Springer
13 years 11 months ago
1999
Springer
The behaviour of many systems is naturally modelled by a set of ordinary differential equations (ODEs) which are parametric. Since decisions are often based on relations over these...
FROCOS
2000
Springer
13 years 10 months ago
2000
Springer
The behaviour of many systems is naturally modelled by a set of ordinary differential equations (ODEs) which are parametric. Since decisions are often based on relations over these...
CP
2000
Springer
13 years 11 months ago
2000
Springer
Most of complete search algorithms over Constraint Satisfaction Problems (csp) are based on Standard Backtracking. Two main enhancements of this basic scheme have been proposed : r...