229 search results - page 27 / 46 » Structure and Performance of Fine-Grain Parallelism in Genet... |
BMCBI
2008
13 years 9 months ago
2008
Background: Expressed sequence tag (EST) collections are composed of a high number of single-pass, redundant, partial sequences, which need to be processed, clustered, and annotat...
IPPS
2010
IEEE
13 years 7 months ago
2010
IEEE
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
IPPS
2007
IEEE
14 years 3 months ago
2007
IEEE
Targeted optimization of program segments can provide an additional program speedup over the highest default optimization level, such as -O3 in GCC. The key challenge is how to au...
SIGSOFT
2007
ACM
14 years 9 months ago
2007
ACM
We present novel algorithms for parallel testing of code that takes structurally complex test inputs. The algorithms build on the Korat algorithm for constraint-based generation o...
GECCO
2007
Springer
14 years 3 months ago
2007
Springer
In this paper, we present a study on the fault tolerance nature of the island model when applied to Genetic Algorithms. Parallel and distributed models have been extensively appli...