Sciweavers

2504 search results - page 272 / 501
» Methods for comparing rankings of search engine results
Sort
View
BMCBI
2011
14 years 9 months ago
Simulated evolution applied to study the genetic code optimality using a model of codon reassignments
Background: As the canonical code is not universal, different theories about its origin and organization have appeared. The optimization or level of adaptation of the canonical ge...
Jose Santos, Ángel Monteagudo
EVOW
2007
Springer
15 years 8 months ago
Exact/Heuristic Hybrids Using rVNS and Hyperheuristics for Workforce Scheduling
In this paper we study a complex real-world workforce scheduling problem. We propose a method of splitting the problem into smaller parts and solving each part using exhaustive sea...
Stephen Remde, Peter I. Cowling, Keshav P. Dahal, ...
AMAI
2004
Springer
15 years 7 months ago
Warped Landscapes and Random Acts of SAT Solving
Recent dynamic local search (DLS) algorithms such as SAPS are amongst the state-of-the-art methods for solving the propositional satisfiability problem (SAT). DLS algorithms modi...
Dave A. D. Tompkins, Holger H. Hoos
WSDM
2009
ACM
191views Data Mining» more  WSDM 2009»
15 years 8 months ago
Generating labels from clicks
The ranking function used by search engines to order results is learned from labeled training data. Each training point is a (query, URL) pair that is labeled by a human judge who...
Rakesh Agrawal, Alan Halverson, Krishnaram Kenthap...
BMCBI
2008
106views more  BMCBI 2008»
15 years 2 months ago
Searching for evolutionary distant RNA homologs within genomic sequences using partition function posterior probabilities
Background: Identification of RNA homologs within genomic stretches is difficult when pairwise sequence identity is low or unalignable flanking residues are present. In both cases...
Usman Roshan, Satish Chikkagoudar, Dennis R. Lives...