589 search results - page 61 / 118 » Local Search Algorithms for SAT: An Empirical Evaluation |
CIBCB
2007
IEEE
15 years 3 months ago
2007
IEEE
-- A large and reliable DNA codeword library is the key to the success of DNA based computing. Searching for the set of reliable DNA codewords is an NP-hard problem, which can take...
119
click to vote
BIBE
2008
IEEE
15 years 6 months ago
2008
IEEE
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
118
click to vote
AVBPA
2003
Springer
15 years 5 months ago
2003
Springer
: Constraint Shape Model is proposed to extract facial feature using two different search methods for contour points and control points individually. In the proposed algorithm, sal...
GECCO
2005
Springer
15 years 5 months ago
2005
Springer
The well-known Griewangk function, used for evaluation of evolutionary algorithms, becomes easier as the number of dimensions grows. This paper suggests three alternative implemen...
ECAI
2004
Springer
15 years 5 months ago
2004
Springer
Distributed constraint satisfaction, in its most general acceptation, involves a collection of agents solving local constraint satisfaction subproblems, and a communication protoco...