633 search results - page 25 / 127 » Locality and Hard SAT-Instances |
AI
2003
Springer
14 years 3 months ago
2003
Springer
Sets of DNA strands that satisfy combinatorial constraints play an important role in various approaches to biomolecular computation, nanostructure design, and molecular tagging. Th...
ICDM
2007
IEEE
14 years 4 months ago
2007
IEEE
Support vector clustering transforms the data into a high dimensional feature space, where a decision function is computed. In the original space, the function outlines the bounda...
CVPR
2009
IEEE
2009
IEEE
Fourier analysis and Gabor filtering for texture analysis and local reconstruction of general shapes
14 years 1 months ago
Since the pioneering work of Gibson in 1950, ShapeFrom-Texture has been considered by researchers as a hard problem, mainly due to restrictive assumptions which often limit its ap...
IJCAI
2003
13 years 11 months ago
2003
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 detect unso...
ATAL
2008
Springer
13 years 11 months ago
2008
Springer
Distributed constraint optimization (DCOP) is a promising approach to coordination, scheduling and task allocation in multi agent networks. In large-scale or low-bandwidth network...