879 search results - page 26 / 176 » Optimizing for Reduced Code Space using Genetic Algorithms |
197
Voted
NC
1998
15 years 7 months ago
1998
In this paper we introduce an efficient implementation of asynchronously parallel genetic algorithm with adaptive genetic operators. The classic genetic algorithm paradigm is exte...
183
Voted
3DIM
2005
IEEE
16 years 10 hour ago
2005
IEEE
Many optimization processes encounter a problem in efficiently reaching a global minimum or a near global minimum. Traditional methods such as Levenberg-Marquardt algorithm and t...
174
Voted
GECCO
2003
Springer
15 years 11 months ago
2003
Springer
The performance of genetic programming relies mostly on population-contained variation. If the population diversity is low then there will be a greater chance of the algorithm bein...
162
Voted
EUROGP
2004
Springer
15 years 11 months ago
2004
Springer
In this paper, we use multi-objective techniques to compare different genetic programming systems, permitting our comparison to concentrate on the effect of representation and sepa...
167
Voted
CEC
2008
IEEE
16 years 26 days ago
2008
IEEE
— The high-level synthesis process involves three interdependent and NP-complete optimization problems: (i) the operation scheduling, (ii) the resource allocation, and (iii) the ...