Inproceedings836: Unterschied zwischen den Versionen
K (Added from ontology) |
K (Added from ontology) |
||
| Zeile 1: | Zeile 1: | ||
| + | {{Publikation Author | ||
| + | |Rank=3 | ||
| + | |Author=Martin Middendorf | ||
| + | }} | ||
{{Publikation Author | {{Publikation Author | ||
|Rank=2 | |Rank=2 | ||
| Zeile 6: | Zeile 10: | ||
|Rank=1 | |Rank=1 | ||
|Author=Bernd Scheuermann | |Author=Bernd Scheuermann | ||
| − | |||
| − | |||
| − | |||
| − | |||
}} | }} | ||
{{Publikation Author | {{Publikation Author | ||
| Zeile 31: | Zeile 31: | ||
time-scattered heuristic. A comparison with the standard heuristic and candidate lists is also given. | time-scattered heuristic. A comparison with the standard heuristic and candidate lists is also given. | ||
|VG Wort-Seiten= | |VG Wort-Seiten= | ||
| − | |||
|Projekt=OptRek, | |Projekt=OptRek, | ||
|Forschungsgruppe= | |Forschungsgruppe= | ||
| + | }} | ||
| + | {{Forschungsgebiet Auswahl | ||
| + | |Forschungsgebiet=Rechnerarchitektur | ||
| + | }} | ||
| + | {{Forschungsgebiet Auswahl | ||
| + | |Forschungsgebiet=Rekonfigurierbarkeit | ||
| + | }} | ||
| + | {{Forschungsgebiet Auswahl | ||
| + | |Forschungsgebiet=Rekonfigurierbare Gitter | ||
| + | }} | ||
| + | {{Forschungsgebiet Auswahl | ||
| + | |Forschungsgebiet=Ameisenalgorithmen | ||
}} | }} | ||
Version vom 15. August 2009, 11:51 Uhr
Time-Scattered Heuristic for the Hardware Implementation of Population-based ACO
Time-Scattered Heuristic for the Hardware Implementation of Population-based ACO
Published: 2004
September
Herausgeber: M. Dorigo et al.
Buchtitel: Ant colony Optimization and Swarm Intelligence. Proc. of the ANTS 2004 conference
Ausgabe: 3172
Reihe: LNCS
Seiten: 250-261
Verlag: Springer-Verlag
Referierte Veröffentlichung
BibTeX
Kurzfassung
We present a new kind of heuristic guidance as an extension to the Population-based Ant Colony Optimization (P-ACO) implemented in hardware on a Field Programmable Gate Array (FPGA). The heuristic information is obtained by transforming standard heuristic information into small time-scattered heuristic-vectors of favourable ant decisions. This approach is suited for heuristics which allow for an a priori calculation of the heuristics information. Using the proposed method, an ant can build-up a solution in quasi-linear time. Experimental studies measure the performance of the
time-scattered heuristic. A comparison with the standard heuristic and candidate lists is also given.
Ameisenalgorithmen, Rekonfigurierbarkeit, Rechnerarchitektur, Rekonfigurierbare Gitter