1041 search results - page 83 / 209 » Randomizing Reductions of Search Problems |
JMLR
2010
13 years 2 months ago
2010
Of all of the challenges which face the selection of relevant features for predictive data mining or pattern recognition modeling, the adaptation of computational intelligence tec...
JAIR
2000
13 years 7 months ago
2000
The local search algorithm WSat is one of the most successful algorithms for solving the satisfiability (SAT) problem. It is notably effective at solving hard Random 3-SAT instanc...
BMCBI
2008
13 years 8 months ago
2008
Background: Analysis of complex samples with tandem mass spectrometry (MS/MS) has become routine in proteomic research. However, validation of database search results creates a bo...
CP
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. 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 de...
WWW
2010
ACM
14 years 3 months ago
2010
ACM
Result diversity is a topic of great importance as more facets of queries are discovered and users expect to find their desired facets in the first page of the results. However,...