Inproceedings52: Unterschied zwischen den Versionen
K (Added from ontology) |
Uri (Diskussion | Beiträge) |
||
| (4 dazwischenliegende Versionen von einem anderen Benutzer werden nicht angezeigt) | |||
| Zeile 1: | Zeile 1: | ||
| + | {{Publikation Erster Autor | ||
| + | |ErsterAutorNachname=Guntsch | ||
| + | |ErsterAutorVorname=Michael | ||
| + | }} | ||
{{Publikation Author | {{Publikation Author | ||
| − | |Rank= | + | |Rank=5 |
| − | |Author= | + | |Author=Oliver Diessel |
}} | }} | ||
{{Publikation Author | {{Publikation Author | ||
| Zeile 8: | Zeile 12: | ||
}} | }} | ||
{{Publikation Author | {{Publikation Author | ||
| − | |Rank= | + | |Rank=2 |
| − | |Author= | + | |Author=Bernd Scheuermann |
| + | }} | ||
| + | {{Publikation Author | ||
| + | |Rank=3 | ||
| + | |Author=Hartmut Schmeck | ||
}} | }} | ||
{{Publikation Author | {{Publikation Author | ||
| Zeile 16: | Zeile 24: | ||
}} | }} | ||
{{Publikation Author | {{Publikation Author | ||
| − | |Rank= | + | |Rank=7 |
| − | |Author= | + | |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, |
| − | |Forschungsgebiet=Ameisenalgorithmen | + | |Forschungsgruppe=Effiziente Algorithmen |
| − | | | + | }} |
| − | | | + | {{Forschungsgebiet Auswahl |
| + | |Forschungsgebiet=Ameisenalgorithmen | ||
| + | }} | ||
| + | {{Forschungsgebiet Auswahl | ||
| + | |Forschungsgebiet=Rekonfigurierbarkeit | ||
| + | }} | ||
| + | {{Forschungsgebiet Auswahl | ||
| + | |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