78 search results - page 10 / 16 » Local Search Algorithms for Partial MAXSAT |
BMCBI
2006
14 years 12 months ago
2006
Background: Molecular biologists work with DNA databases that often include entire genomes. A common requirement is to search a DNA database to find exact matches for a nondegener...
ROMAN
2007
IEEE
15 years 6 months ago
2007
IEEE
Abstract—Models that can efficiently, compactly, and semantically represent potential users are important tools for human-robot interaction applications. We model a person as a p...
117
click to vote
HUMO
2007
Springer
15 years 3 months ago
2007
Springer
We propose a method to find candidate 2D articulated model configurations by searching for locally optimal configurations under a weak but computationally manageable fitness functi...
ICDM
2009
IEEE
14 years 9 months ago
2009
IEEE
Given a large transaction database, association analysis is concerned with efficiently finding strongly related objects. Unlike traditional associate analysis, where relationships ...
CP
2005
Springer
15 years 5 months ago
2005
Springer
Classical methods for solving numerical CSPs are based on a branch and prune algorithm, a dichotomic enumeration process interleaved with a consistency filtering algorithm. In man...