Sciweavers

AAAI
1998
14 years 27 days ago
On the Conversion between Non-Binary and Binary Constraint Satisfaction Problems
It is well known that any non-binary discrete constraint satisfaction problem (CSP) can be translated into an equivalent binary CSP. Two translations are known: the dual graph tra...
Fahiem Bacchus, Peter van Beek
PUK
2001
14 years 27 days ago
Realizing a Global Hyperpolyhedron Constraint via LP Techniques
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...
Miguel A. Salido, Adriana Giret, Federico Barber