Inproceedings52: Unterschied zwischen den Versionen
K (Added from ontology) |
Uri (Diskussion | Beiträge) |
||
| (Eine dazwischenliegende Version von einem anderen Benutzer wird nicht angezeigt) | |||
| Zeile 2: | Zeile 2: | ||
|ErsterAutorNachname=Guntsch | |ErsterAutorNachname=Guntsch | ||
|ErsterAutorVorname=Michael | |ErsterAutorVorname=Michael | ||
| + | }} | ||
| + | {{Publikation Author | ||
| + | |Rank=5 | ||
| + | |Author=Oliver Diessel | ||
}} | }} | ||
{{Publikation Author | {{Publikation Author | ||
|Rank=4 | |Rank=4 | ||
|Author=Martin Middendorf | |Author=Martin Middendorf | ||
| + | }} | ||
| + | {{Publikation Author | ||
| + | |Rank=2 | ||
| + | |Author=Bernd Scheuermann | ||
}} | }} | ||
{{Publikation Author | {{Publikation Author | ||
| Zeile 12: | Zeile 20: | ||
}} | }} | ||
{{Publikation Author | {{Publikation Author | ||
| − | |Rank= | + | |Rank=6 |
| − | |Author= | + | |Author=Hossam ElGindy |
}} | }} | ||
{{Publikation Author | {{Publikation Author | ||
|Rank=7 | |Rank=7 | ||
|Author=Keith So | |Author=Keith So | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
}} | }} | ||
{{Inproceedings | {{Inproceedings | ||
| Zeile 36: | Zeile 36: | ||
{{Publikation Details | {{Publikation Details | ||
|Abstract=We propose to modify a type of ant algorithm called Population based Ant Colony Optimization (P-ACO) to allow implementation on an FPGA architecture. Ant algorithms are adapted from the natural behavior of ants and used to find good solutions to combinatorial optimization problems. General layout on the FPGA and algorithmic description are covered. The most notable achievements featured in this paper are a runtime reduction and including the approximation of the heuristic function by a small set of favored decisions which changes over time. | |Abstract=We propose to modify a type of ant algorithm called Population based Ant Colony Optimization (P-ACO) to allow implementation on an FPGA architecture. Ant algorithms are adapted from the natural behavior of ants and used to find good solutions to combinatorial optimization problems. General layout on the FPGA and algorithmic description are covered. The most notable achievements featured in this paper are a runtime reduction and including the approximation of the heuristic function by a small set of favored decisions which changes over time. | ||
| − | + | |Projekt=AntAlg, | |
| − | |Projekt=AntAlg, | + | |Forschungsgruppe=Effiziente Algorithmen |
| − | |Forschungsgruppe= | + | }} |
| + | {{Forschungsgebiet Auswahl | ||
| + | |Forschungsgebiet=Ameisenalgorithmen | ||
}} | }} | ||
{{Forschungsgebiet Auswahl | {{Forschungsgebiet Auswahl | ||
| Zeile 45: | Zeile 47: | ||
{{Forschungsgebiet Auswahl | {{Forschungsgebiet Auswahl | ||
|Forschungsgebiet=Rechnerarchitektur | |Forschungsgebiet=Rechnerarchitektur | ||
| − | |||
| − | |||
| − | |||
}} | }} | ||
Aktuelle Version vom 24. September 2009, 20:20 Uhr
Population based Ant Colony Optimization on FPGA
Population based Ant Colony Optimization on FPGA
Published: 2002
Buchtitel: Proceedings of the IEEE International Conference on Field-Programmable Technology (FPT), Hong Kong, 2002
Seiten: 125-133
Referierte Veröffentlichung
BibTeX
Kurzfassung
We propose to modify a type of ant algorithm called Population based Ant Colony Optimization (P-ACO) to allow implementation on an FPGA architecture. Ant algorithms are adapted from the natural behavior of ants and used to find good solutions to combinatorial optimization problems. General layout on the FPGA and algorithmic description are covered. The most notable achievements featured in this paper are a runtime reduction and including the approximation of the heuristic function by a small set of favored decisions which changes over time.
Ameisenalgorithmen, Rekonfigurierbarkeit, Rechnerarchitektur