Inproceedings1680: Unterschied zwischen den Versionen
K (Added from ontology) |
K (Added from ontology) |
||
| Zeile 2: | Zeile 2: | ||
|Rank=2 | |Rank=2 | ||
|Author=Sanaz Mostaghim | |Author=Sanaz Mostaghim | ||
| − | |||
| − | |||
| − | |||
| − | |||
}} | }} | ||
{{Publikation Author | {{Publikation Author | ||
| Zeile 14: | Zeile 10: | ||
|Rank=3 | |Rank=3 | ||
|Author=Hartmut Schmeck | |Author=Hartmut Schmeck | ||
| + | }} | ||
| + | {{Publikation Author | ||
| + | |Rank=1 | ||
| + | |Author=Peter Bungert | ||
}} | }} | ||
{{Inproceedings | {{Inproceedings | ||
Version vom 15. August 2009, 23:06 Uhr
Design of gate array circuits using evolutionary algorithms
Design of gate array circuits using evolutionary algorithms
Published: 2008
Buchtitel: International Conference on Architecture of Computing Systems
Ausgabe: 4934
Reihe: LNCS
Seiten: 38-50
Verlag: Springer
Referierte Veröffentlichung
BibTeX
Kurzfassung
In this paper, we study the design of combinational logic
circuits using evolutionary algorithms. In particular, this paper is about
fitness assignment methods and recombination operators for speeding
up the optimisation process. We propose a new fitness assignment mechanism
called MaxMin method and compare it with the straightforward
method used in the literature. The results show significant improvements
both in terms of computational time and quality of the solutions. Furthermore,
a new cross-over operator called area cross-over has been introduced
and compared with other typical operators. This operator is particularly
designed for gate matrices where two rectangular logic blocks
are exchanged between the individuals. We observe that the MaxMin
fitness assignment as well as the area cross-over operator considerably
improve the performance of the evolutionary optimisation.
Evolutionäre Algorithmen, FPGA