1310 search results - page 43 / 262 » A parallel genetic algorithm to solve the set-covering probl... |
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
The three mechanisms of crossover are transmission, assortment, and respect. Of these three mechanisms, assortment (i.e. recombination) is traditionally viewed as the primary feat...
82
Voted
GECCO
2004
Springer
15 years 3 months ago
2004
Springer
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This proble...
SPDP
1993
IEEE
15 years 1 months ago
1993
IEEE
In this paper, we propose a new parallel genetic alge rithm (GA), called Extended Distributed Genetic Algorithm (EDGA), for channel routing problem. The EDGA combines the advantag...
103
click to vote
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Multiprocessor task scheduling is an important and computationally difficult problem. This paper proposes a comparison study of genetic algorithm and list scheduling algorithm. Bo...
IPPS
2003
IEEE
15 years 3 months ago
2003
IEEE
Given two strings and of lengths Ñ and Ò, respectively, the all-substrings longest common subsequence (ALCS) problem obtains the lengths of the subsequences common to and any su...