654 search results - page 35 / 131 » On the Approximation of Computing Evolutionary Trees |
106
click to vote
IPPS
1998
IEEE
15 years 2 months ago
1998
IEEE
We present a rst randomized Ologk n time and On+m work CRCWPRAM algorithm for nding a spanning forest of an undirected dense graph with n vertices. Furthermore we construct a rando...
GECCO
2008
Springer
14 years 10 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...
GECCO
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. In many real-world applications of evolutionary computation, it is essential to reduce the number of fitness evaluations. To this end, computationally efficient models c...
BMCBI
2006
14 years 9 months ago
2006
Background: Evolutionary genomics requires management and filtering of large numbers of diverse genomic sequences for accurate analysis and inference on evolutionary processes of ...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
This paper introduces hyper-ellipsoids as an improvement to hyper-spheres as intrusion detectors in a negative selection problem within an artificial immune system. Since hyper-s...