167 search results - page 27 / 34 » A Genetic Local Search Algorithm for Random Binary Constrain... |
APPROX
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX k-CSP(P)). We show that if the set of assignments accepted by P co...
CVPR
2005
IEEE
14 years 9 months ago
2005
IEEE
Object detection is challenging partly due to the limited discriminative power of local feature descriptors. We amend this limitation by incorporating spatial constraints among ne...
ISAAC
2004
Springer
14 years 27 days ago
2004
Springer
Motivation: Motif detection for DNA sequences has many important applications in biological studies, e.g., locating binding sites and regulatory signals, and designing genetic prob...
DAM
2000
13 years 7 months ago
2000
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
CP
2000
Springer
13 years 12 months ago
2000
Springer
Most of complete search algorithms over Constraint Satisfaction Problems (csp) are based on Standard Backtracking. Two main enhancements of this basic scheme have been proposed : r...