161 search results - page 7 / 33 » Optimizing Multiple Spaced Seeds for Homology Search |
ICTAI
2002
IEEE
14 years 14 days ago
2002
IEEE
In this paper, we propose new dominance relations that can speed up significantly the solution process of nonlinear constrained dynamic optimization problems in discrete time and...
IJCAI
2001
13 years 9 months ago
2001
Most formulations of Reinforcement Learning depend on a single reinforcement reward value to guide the search for the optimal policy solution. If observation of this reward is rar...
IPPS
2010
IEEE
13 years 5 months ago
2010
IEEE
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
Using a set of model landscapes we examine how different mutation rates affect different search metrics. We show that very universal heuristics, such as 1/N and the error threshol...
WABI
2005
Springer
14 years 1 months ago
2005
Springer
Multiple Sequence Alignment (MSA) is one of the most fundamental problems in computational molecular biology. The running time of the best known scheme for finding an optimal ali...