6095 search results - page 969 / 1219 » Learning in Local Search |
288
click to vote
NLP
2000
15 years 9 months ago
2000
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
178
click to vote
JCDL
2010
ACM
15 years 8 months ago
2010
ACM
In search engines, ranking algorithms measure the importance and relevance of documents mainly based on the contents and relationships between documents. User attributes are usual...
194
click to vote
JBI
2004
15 years 7 months ago
2004
Microarray analysis using clustering algorithms can suffer from lack of inter-method consistency in assigning related gene-expression profiles to clusters. Obtaining a consensus s...
164
click to vote
AAAI
2000
15 years 7 months ago
2000
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...
172
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: The increasing number of sequenced genomes provides the basis for exploring the genetic and functional diversity within the tree of life. Only a tiny fraction of the e...