1300 search results - page 208 / 260 » Constraint satisfaction problems and global cardinality cons... |
IJCAI
2003
14 years 11 months ago
2003
In [Jegou, 1993], a decomposition method has been introduced for improving search efficiency in the area of Constraint Satisfaction Problems. This method is based on properties of...
EC
2008
14 years 9 months ago
2008
The development of successful metaheuristic algorithms such as local search for a difficult problems such as satisfiability testing (SAT) is a challenging task. We investigate an ...
SCP
1998
14 years 9 months ago
1998
Consistency techniques are an e cient way of tackling constraint satisfaction problems (CSP). In particular, various arc-consistency algorithms have been designed such as the time...
VLDB
2002
ACM
14 years 9 months ago
2002
ACM
Current search engines can hardly cope adequately with fuzzy predicates defined by complex preferences. The biggest problem of search engines implemented with standard SQL is that...
DAC
2008
ACM
15 years 10 months ago
2008
ACM
Many computational tools have recently begun to benefit from the use of the symmetry inherent in the tasks they solve, and use general-purpose graph symmetry tools to uncover this...