1158 search results - page 162 / 232 » Approximation Algorithms for the Fixed-Topology Phylogenetic... |
162
click to vote
ALENEX
2009
15 years 3 months ago
2009
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...
159
click to vote
CPM
2000
Springer
15 years 10 months ago
2000
Springer
The syntenic dista nce between two species is the minimum number of fusions, fissions, and translocations required to transform one genome into the other. The linear syntenic dis...
162
click to vote
AAIM
2005
Springer
15 years 11 months ago
2005
Springer
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
167
click to vote
AAAI
2004
15 years 7 months ago
2004
This paper considers online stochastic optimization problems where time constraints severely limit the number of offline optimizations which can be performed at decision time and/...
157
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
In evolutionary algorithms, the typical post-processing phase involves selection of the best-of-run individual, which becomes the final outcome of the evolutionary run. Trivial f...