942 search results - page 148 / 189 » Distance Constraint Satisfaction Problems |
165
click to vote
ICASSP
2010
IEEE
15 years 3 months ago
2010
IEEE
Handling large amounts of data, such as large image databases, requires the use of approximate nearest neighbor search techniques. Recently, Hamming embedding methods such as spec...
116
click to vote
CP
2007
Springer
15 years 9 months ago
2007
Springer
It is known that Constraint Satisfaction Problems (CSP) can be converted into Boolean Satisfiability problems (SAT); however how to encode a CSP into a SAT problem such that a SAT...
100
click to vote
GECCO
2004
Springer
15 years 8 months ago
2004
Springer
The optimization of the epoxy polymerization process involves a number of conflicting objectives and more than twenty decision parameters. In this paper, the problem is treated tr...
138
click to vote
CP
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to de...
113
click to vote
GECCO
2004
Springer
15 years 8 months ago
2004
Springer
We discuss the computational complexity of random 2D Ising spin glasses, which represent an interesting class of constraint satisfaction problems for black box optimization. Two ex...