559 search results - page 56 / 112 » Fast SDP Algorithms for Constraint Satisfaction Problems |
COMPULOG
1999
Springer
13 years 12 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...
DSS
2007
13 years 7 months ago
2007
International crime and terrorism have drawn increasing attention in recent years. Retrieving relevant information from criminal records and suspect communications is important in...
CP
2003
Springer
14 years 27 days ago
2003
Springer
Symmetry in a Constraint Satisfaction Problem can cause wasted search, which can be avoided by adding constraints to the CSP to exclude symmetric assignments or by modifying the s...
AAAI
2007
13 years 10 months ago
2007
Extensional (table) constraints are an important tool for attacking combinatorial problems with constraint programming. Recently there has been renewed interest in fast propagatio...
CONSTRAINTS
2002
13 years 7 months ago
2002
In this paper, we report the design and implementation of a constraint-based interactive train rescheduling tool, a project in collaboration with the International Institute for So...