2111 search results - page 84 / 423 » Understanding the Yarowsky Algorithm |
BMCBI
2007
14 years 9 months ago
2007
Background: The number of algorithms available to predict ligand-protein interactions is large and ever-increasing. The number of test cases used to validate these methods is usua...
BMCBI
2007
14 years 9 months ago
2007
Background: This work addresses the problem of detecting conserved transcription factor binding sites and in general regulatory regions through the analysis of sequences from homo...
105
click to vote
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...
GECCO
2010
Springer
15 years 2 months ago
2010
Springer
Crowding is a technique used in genetic algorithms to preserve diversity in the population and to prevent premature convergence to local optima. It consists of pairing each offsp...
COR
2006
14 years 10 months ago
2006
Over the last decade and a half, tabu search algorithms for machine scheduling have gained a near-mythical reputation by consistently equaling or establishing state-of-the-art per...