2393 search results - page 28 / 479 » Bounds-Consistent Local Search |
BMCBI
2011
12 years 11 months ago
2011
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...
AAAI
2004
13 years 9 months ago
2004
Algorithms based on following local gradient information are surprisingly effective for certain classes of constraint satisfaction problems. Unfortunately, previous local search a...
IJCAI
2007
13 years 9 months ago
2007
Local search procedures for solving satisfiability problems have attracted considerable attention since the development of GSAT in 1992. However, recent work indicates that for m...
GIS
2009
ACM
14 years 8 months ago
2009
ACM
Many popular online services provide "local" or "yellow-pages" search, but none of them allow users to customize the search over user-specified data. Instead, ...
DISOPT
2011
13 years 2 months ago
2011
SAT and MAX SAT are among the most prominent problems for which local search algorithms have been successfully applied. A fundamental task for such an algorithm is to increase the...