Inproceedings836: Unterschied zwischen den Versionen
K (Added from ontology) |
Uri (Diskussion | Beiträge) |
||
| (Eine dazwischenliegende Version von einem anderen Benutzer wird nicht angezeigt) | |||
| Zeile 6: | Zeile 6: | ||
|Rank=2 | |Rank=2 | ||
|Author=Michael Guntsch | |Author=Michael Guntsch | ||
| + | }} | ||
| + | {{Publikation Author | ||
| + | |Rank=3 | ||
| + | |Author=Martin Middendorf | ||
}} | }} | ||
{{Publikation Author | {{Publikation Author | ||
|Rank=4 | |Rank=4 | ||
|Author=Hartmut Schmeck | |Author=Hartmut Schmeck | ||
| − | |||
| − | |||
| − | |||
| − | |||
}} | }} | ||
{{Inproceedings | {{Inproceedings | ||
| Zeile 30: | Zeile 30: | ||
|Abstract=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 | |Abstract=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. | time-scattered heuristic. A comparison with the standard heuristic and candidate lists is also given. | ||
| − | + | |Projekt=OptRek, | |
| − | |Projekt=OptRek, | + | |Forschungsgruppe=Effiziente Algorithmen |
| − | |Forschungsgruppe= | ||
}} | }} | ||
{{Forschungsgebiet Auswahl | {{Forschungsgebiet Auswahl | ||
| − | |Forschungsgebiet= | + | |Forschungsgebiet=Ameisenalgorithmen |
}} | }} | ||
{{Forschungsgebiet Auswahl | {{Forschungsgebiet Auswahl | ||
| − | |Forschungsgebiet= | + | |Forschungsgebiet=Rekonfigurierbare Gitter |
}} | }} | ||
{{Forschungsgebiet Auswahl | {{Forschungsgebiet Auswahl | ||
| − | |Forschungsgebiet= | + | |Forschungsgebiet=Rekonfigurierbarkeit |
}} | }} | ||
{{Forschungsgebiet Auswahl | {{Forschungsgebiet Auswahl | ||
| − | |Forschungsgebiet= | + | |Forschungsgebiet=Rechnerarchitektur |
}} | }} | ||
Aktuelle Version vom 24. September 2009, 20:21 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