264 search results - page 37 / 53 » On the possibility of faster SAT algorithms |
87
Voted
FOCS
2008
IEEE
14 years 11 months ago
2008
IEEE
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
99
Voted
BMCBI
2008
14 years 10 months ago
2008
Background: Searching for similarities in protein and DNA databases has become a routine procedure in Molecular Biology. The Smith-Waterman algorithm has been available for more t...
105
click to vote
PAKDD
2009
ACM
15 years 7 months ago
2009
ACM
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
105
click to vote
ICAC
2006
IEEE
15 years 4 months ago
2006
IEEE
— As Internet worms become ever faster and more sophisticated, it is important to be able to extract worm signatures in an accurate and timely manner. In this paper, we apply mac...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
The development of the XCS Learning Classifier System has produced a robust and stable implementation that performs competitively in direct-reward environments. Although investig...