Sciweavers

1563 search results - page 39 / 313
» Performance comparison of memetic algorithms
Sort
View
GECCO
2006
Springer
132views Optimization» more  GECCO 2006»
14 years 13 days ago
The role of diverse populations in phylogenetic analysis
The most popular approaches for reconstructing phylogenetic trees attempt to solve NP-hard optimization criteria such as maximum parsimony (MP). Currently, the bestperforming heur...
Tiffani L. Williams, Marc L. Smith
BMCBI
2005
152views more  BMCBI 2005»
13 years 8 months ago
Improved profile HMM performance by assessment of critical algorithmic features in SAM and HMMER
Background: Profile hidden Markov model (HMM) techniques are among the most powerful methods for protein homology detection. Yet, the critical features for successful modelling ar...
Markus Wistrand, Erik L. L. Sonnhammer
PC
2007
161views Management» more  PC 2007»
13 years 8 months ago
High performance combinatorial algorithm design on the Cell Broadband Engine processor
The Sony–Toshiba–IBM Cell Broadband Engine (Cell/B.E.) is a heterogeneous multicore architecture that consists of a traditional microprocessor (PPE) with eight SIMD co-process...
David A. Bader, Virat Agarwal, Kamesh Madduri, Seu...
IPPS
1994
IEEE
14 years 27 days ago
A Comparison of Heuristics for Scheduling DAGs on Multiprocessors
Many algorithms to schedule DAGs on multiprocessors have been proposed, but there has been little work done to determine their effectiveness. Since multi-processor scheduling is a...
Carolyn McCreary, A. A. Khan, J. J. Thompson, M. E...
ICML
2005
IEEE
14 years 9 months ago
Supervised versus multiple instance learning: an empirical comparison
We empirically study the relationship between supervised and multiple instance (MI) learning. Algorithms to learn various concepts have been adapted to the MI representation. Howe...
Soumya Ray, Mark Craven