Sciweavers

1563 search results - page 176 / 313
» Performance comparison of memetic algorithms
Sort
View
126
Voted
BMCBI
2007
175views more  BMCBI 2007»
15 years 3 months ago
CLUSS: Clustering of protein sequences based on a new similarity measure
Background: The rapid burgeoning of available protein data makes the use of clustering within families of proteins increasingly important. The challenge is to identify subfamilies...
Abdellali Kelil, Shengrui Wang, Ryszard Brzezinski...
139
Voted
RECOMB
2004
Springer
16 years 4 months ago
Designing multiple simultaneous seeds for DNA similarity search
The challenge of similarity search in massive DNA sequence databases has inspired major changes in BLAST-style alignment tools, which accelerate search by inspecting only pairs of...
Yanni Sun, Jeremy Buhler
132
Voted
IPPS
2006
IEEE
15 years 9 months ago
Platform-based FPGA architecture: designing high-performance and low-power routing structure for realizing DSP applications
The novel design of an efficient FPGA interconnection architecture with multiple Switch Boxes (SB) and hardwired connections for realizing data intensive applications (i.e. DSP ap...
Kostas Siozios, Konstantinos Tatas, Dimitrios Soud...
130
Voted
HM
2005
Springer
97views Optimization» more  HM 2005»
15 years 9 months ago
Comparing Parallelization of an ACO: Message Passing vs. Shared Memory
We present a shared memory approach to the parallelization of the Ant Colony Optimization (ACO) metaheuristic and a performance comparison with an existing message passing implemen...
Pierre Delisle, Marc Gravel, Michaël Krajecki...
GECCO
2010
Springer
190views Optimization» more  GECCO 2010»
15 years 8 months ago
Comparing the (1+1)-CMA-ES with a mirrored (1+2)-CMA-ES with sequential selection on the noiseless BBOB-2010 testbed
In this paper, we compare the (1+1)-CMA-ES to the (1+2s m)CMA-ES, a recently introduced quasi-random (1+2)-CMAES that uses mirroring as derandomization technique as well as a sequ...
Anne Auger, Dimo Brockhoff, Nikolaus Hansen