Sciweavers

1104 search results - page 72 / 221
» Experimental evaluation of optimal CSMA
Sort
View
109
Voted
GECCO
2005
Springer
132views Optimization» more  GECCO 2005»
15 years 9 months ago
Dormant program nodes and the efficiency of genetic programming
In genetic programming, there is a tendency for individuals in a population to accumulate fragments of code – often called introns – which are redundant in the fitness evaluat...
David Jackson
137
Voted
EUROPAR
2009
Springer
15 years 10 months ago
Process Mapping for MPI Collective Communications
It is an important problem to map virtual parallel processes to physical processors (or cores) in an optimized way to get scalable performance due to non-uniform communication cost...
Jin Zhang, Jidong Zhai, Wenguang Chen, Weimin Zhen...
136
Voted
ISNN
2009
Springer
15 years 10 months ago
An Improved Quantum Evolutionary Algorithm with 2-Crossovers
Quantum evolutionary algorithm (QEA) is proposed on the basis of the concept and principles of quantum computing, which is a classical metaheuristic algorithm for the approximate s...
Zhihui Xing, Haibin Duan, Chunfang Xu
GECCO
2005
Springer
160views Optimization» more  GECCO 2005»
15 years 9 months ago
Designing resilient networks using a hybrid genetic algorithm approach
As high-speed networks have proliferated across the globe, their topologies have become sparser due to the increased capacity of communication media and cost considerations. Relia...
Abdullah Konak, Alice E. Smith
140
Voted
CEC
2008
IEEE
15 years 6 months ago
Directed trees: A powerful representation for sorting and ordering problems
We present a simple framework for dealing with search spaces consisting of permutations. To demonstrate its usefulness, we build upon it a simple (1 + 1)-evolutionary algorithm fo...
Benjamin Doerr, Edda Happ