1310 search results - page 62 / 262 » A parallel genetic algorithm to solve the set-covering probl... |
GECCO
2007
Springer
15 years 1 months ago
2007
Springer
This work addresses selected aspects of natural evolution, especially of the field of population genetics, that are considered to be meaningful for algorithmic further development...
104
click to vote
CIMCA
2008
IEEE
15 years 4 months ago
2008
IEEE
—The computational grid provides a promising platform for the deployment of various high-performance computing applications. In computational grid, an efficient scheduling of tas...
TEC
2002
14 years 9 months ago
2002
Abstract--In this paper, we present an efficient graph-based evolutionary optimization technique called evolutionary graph generation (EGG) and the proposed approach is applied to ...
CEC
2007
IEEE
15 years 4 months ago
2007
IEEE
—The Job-Shop Scheduling Problem (JSSP) is one of the most critical combinatorial optimization problems. The objective of JSSP in this research is to minimize the makespan. In th...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
Cellular genetic algorithms (cGAs) are mainly characterized by their spatially decentralized population, in which individuals can only interact with their neighbors. In this work,...