Population size and processing time in a genetic algorithm
This paper presents several experiments with a genetic algorithm (GA) for designing combinational logic circuits. The study addresses the population size and the processing time for achieving a solution in order to establish a compromise between the two parametrs. Furthermore, it is also investigate...
| Autor principal: | |
|---|---|
| Outros Autores: | , |
| Formato: | conferenceObject |
| Idioma: | eng |
| Publicado em: |
2019
|
| Texto completo: | http://hdl.handle.net/10400.22/13112 |
| País: | Portugal |
| Oai: | oai:recipp.ipp.pt:10400.22/13112 |