1310 search results - page 108 / 262 » A parallel genetic algorithm to solve the set-covering probl... |
158
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
We introduce a clustering-based method of subpopulation management in genetic programming (GP) called Evolutionary Tree Genetic Programming (ETGP). The biological motivation behin...
159
click to vote
GECCO
2007
Springer
16 years 5 days ago
2007
Springer
One of the most controversial yet enduring hypotheses about what genetic algorithms (GAs) are good for concerns the idea that GAs process building-blocks. More specifically, it ha...
179
click to vote
GPEM
2006
15 years 6 months ago
2006
Genetic programming (GP) extends traditional genetic algorithms to automatically induce computer programs. GP has been applied in a wide range of applications such as software ree...
152
Voted
ICCSA
2004
Springer
15 years 11 months ago
2004
Springer
Finding the fastest algorithm to solve a problem is one of the main issues in Computational Geometry. Focusing only on worst case analysis or asymptotic computations leads to the d...
147
click to vote
SC
1994
ACM
15 years 10 months ago
1994
ACM
In recent years, interior point algorithms have been used successfully for solving mediumto large-size linear programming LP problems. In this paper we describe a highly parallel ...