COMPULOG
1999
Springer
14 years 3 months ago
1999
Springer
COMPULOG
1999
Springer
14 years 3 months ago
1999
Springer
Many constraint satisfaction problems can be naturally and efficiently modelled using non-binary constraints like the “all-different” and “global cardinality” constraints...
COMPULOG
1999
Springer
14 years 3 months ago
1999
Springer
Planning and scheduling attracts an unceasing attention of computer science community. However, despite of similar character of both tasks, in most current systems planning and sch...