1310 search results - page 7 / 262 » A parallel genetic algorithm to solve the set-covering probl... |
PPSN
1992
Springer
13 years 11 months ago
1992
Springer
In this paper, we describe the application of a new type of genetic algorithm called the Structured Genetic Algorithm (sGA) for function optimization in nonstationary environments...
SAC
2011
ACM
12 years 10 months ago
2011
ACM
Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand ...
GECCO
1999
Springer
13 years 11 months ago
1999
Springer
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
In this paper, we provide an algorithm that systematically considers all small trees in the search space of genetic programming. These small trees are used to generate useful subr...
IPPS
1997
IEEE
13 years 11 months ago
1997
IEEE