16093 search results - page 356 / 3219 » On the optimality of the neighbor-joining algorithm |
160
click to vote
AE
2005
Springer
16 years 11 days ago
2005
Springer
In this paper, we show how an efficient ant based algorithm, called API and initially designed to perform real parameter optimization, can be adapted to the difficult problem of Hi...
173
click to vote
GECCO
2005
Springer
16 years 11 days ago
2005
Springer
The Internet is different from traditional parallel computing environments, and Distributed Genetic Algorithms (DGAs) for the Internet need to be designed to address these diffe...
182
click to vote
GECCO
2004
Springer
16 years 6 days ago
2004
Springer
Randomized search heuristics, among them randomized local search and evolutionary algorithms, are applied to problems whose structure is not well understood, as well as to problems...
150
click to vote
HIPC
2004
Springer
16 years 6 days ago
2004
Springer
Abstract. We consider the problem of redistributing data on homogeneous and heterogeneous processor rings. The problem arises in several applications, each time after a load-balanc...
155
click to vote
CPM
2003
Springer
16 years 2 days ago
2003
Springer
Given n fragments from k > 2 genomes, we will show how to find an optimal chain of colinear non-overlapping fragments in time O(n logk−2 n log log n) and space O(n logk−2 n...