1310 search results - page 33 / 262 » A parallel genetic algorithm to solve the set-covering probl... |
GECCO
2009
Springer
14 years 3 months ago
2009
Springer
Solving complex, real-world problems with genetic programming (GP) can require extensive computing resources. However, the highly parallel nature of GP facilitates using a large n...
GECCO
2005
Springer
14 years 2 months ago
2005
Springer
This contribution proposes an enhanced and generic selection model for Genetic Algorithms (GAs) and Genetic Programming (GP) which is able to preserve the alleles which are part o...
COMPSAC
2002
IEEE
14 years 1 months ago
2002
IEEE
Genetic algorithms (GAs) are efficient non-gradient stochastic search methods. Parallel GAs are proposed to overcome the deficiencies of sequential GAs, such as low speed and aptn...
HPCC
2007
Springer
14 years 2 months ago
2007
Springer
Many of today’s embedded systems, such as wireless and portable devices rely heavily on the limited power supply. Therefore, energy efficiency becomes one of the major design con...
VLSID
1997
IEEE
14 years 28 days ago
1997
IEEE
The problem of test generation belongs to the class of NP-complete problems and it is becoming more and more di cult as the complexity of VLSI circuits increases, and as long as e...