454 search results - page 36 / 91 » On improving approximate solutions by evolutionary algorithm... |
117
click to vote
RECOMB
1997
Springer
15 years 5 months ago
1997
Springer
The paper studies the computational complexity and approximation algorithms for a new evolutionary distance between multi-chromosomal genomes introduced recently by Ferretti, Nade...
122
Voted
STOC
2003
ACM
16 years 1 months ago
2003
ACM
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
ICDM
2007
IEEE
15 years 7 months ago
2007
IEEE
We address a new learning problem where the goal is to build a predictive model that minimizes prediction time (the time taken to make a prediction) subject to a constraint on mod...
110
click to vote
EVOW
2009
Springer
15 years 8 months ago
2009
Springer
The Learnable Evolution Model (LEM) involves alternating periods of optimization and learning, performa extremely well on a range of problems, a specialises in achieveing good resu...
118
click to vote
CCECE
2006
IEEE
15 years 7 months ago
2006
IEEE
Phylogenetic trees are commonly reconstructed based on hard optimization problems such as Maximum parsimony (MP) and Maximum likelihood (ML). Conventional MP heuristics for produc...