Sciweavers

1830 search results - page 189 / 366
» Optimizing Sorting with Genetic Algorithms
Sort
View
GECCO
2009
Springer
156views Optimization» more  GECCO 2009»
15 years 4 months ago
Characterizing the genetic programming environment for fifth (GPE5) on a high performance computing cluster
Solving complex, real-world problems with genetic programming (GP) can require extensive computing resources. However, the highly parallel nature of GP facilitates using a large n...
Kenneth Holladay
GECCO
2004
Springer
137views Optimization» more  GECCO 2004»
15 years 3 months ago
Evolving Better Multiple Sequence Alignments
Aligning multiple DNA or protein sequences is a fundamental step in the analyses of phylogeny, homology and molecular structure. Heuristic algorithms are applied because optimal mu...
Luke Sheneman, James A. Foster
MST
1998
91views more  MST 1998»
14 years 9 months ago
An Experimental Analysis of Parallel
We have developed a methodology for predicting the performance of parallel algorithms on real parallel machines. The methodology consists of two steps. First, we characterize a mac...
Guy E. Blelloch, Charles E. Leiserson
63
Voted
GECCO
2008
Springer
112views Optimization» more  GECCO 2008»
14 years 11 months ago
Parameter-less evolutionary search
The paper presents the parameter-less implementation of an evolutionary-based search. It does not need any predefined control parameters values, which are usually used for geneti...
Gregor Papa
NETWORKING
2000
14 years 11 months ago
Spare Capacity Planning for Survivable Mesh Networks
Abstract. The design of survivable mesh based STM networks has received considerable attention in recent years and is a complex multiconstraint optimization problem. In this paper,...
Adel Al-Rumaih, David Tipper, Yu Liu, Bryan A. Nor...