Stage-oe-small.jpg

Inproceedings52: Unterschied zwischen den Versionen

Aus Aifbportal
Wechseln zu:Navigation, Suche
K (Added from ontology)
 
K (Added from ontology)
Zeile 1: Zeile 1:
 
{{Publikation Author
 
{{Publikation Author
|Rank=7
+
|Rank=3
|Author=Keith So
+
|Author=Hartmut Schmeck
}}
 
{{Publikation Author
 
|Rank=4
 
|Author=Martin Middendorf
 
 
}}
 
}}
 
{{Publikation Author
 
{{Publikation Author
 
|Rank=1
 
|Rank=1
 
|Author=Michael Guntsch
 
|Author=Michael Guntsch
}}
 
{{Publikation Author
 
|Rank=6
 
|Author=Hossam ElGindy
 
 
}}
 
}}
 
{{Publikation Author
 
{{Publikation Author
Zeile 24: Zeile 16:
 
}}
 
}}
 
{{Publikation Author
 
{{Publikation Author
|Rank=3
+
|Rank=4
|Author=Hartmut Schmeck
+
|Author=Martin Middendorf
 +
}}
 +
{{Publikation Author
 +
|Rank=6
 +
|Author=Hossam ElGindy
 +
}}
 +
{{Publikation Author
 +
|Rank=7
 +
|Author=Keith So
 
}}
 
}}
 
{{Inproceedings
 
{{Inproceedings
Zeile 37: Zeile 37:
 
|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.
 
|VG Wort-Seiten=
 
|VG Wort-Seiten=
|Forschungsgebiet=Ameisenalgorithmen, Rekonfigurierbarkeit, Rechnerarchitektur,
 
 
|Projekt=AntAlg,  
 
|Projekt=AntAlg,  
 
|Forschungsgruppe=Betriebliche Informations- und Kommunikationssysteme,  
 
|Forschungsgruppe=Betriebliche Informations- und Kommunikationssysteme,  
 +
}}
 +
{{Forschungsgebiet Auswahl
 +
|Forschungsgebiet=Rekonfigurierbarkeit
 +
}}
 +
{{Forschungsgebiet Auswahl
 +
|Forschungsgebiet=Ameisenalgorithmen
 +
}}
 +
{{Forschungsgebiet Auswahl
 +
|Forschungsgebiet=Rechnerarchitektur
 
}}
 
}}

Version vom 15. August 2009, 18:58 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.


Projekt

AntAlg



Forschungsgruppe

Betriebliche Informations- und Kommunikationssysteme„Betriebliche Informations- und Kommunikationssysteme“ befindet sich nicht in der Liste (Effiziente Algorithmen, Komplexitätsmanagement, Betriebliche Informationssysteme, Wissensmanagement, Angewandte Technisch-Kognitive Systeme, Information Service Engineering, Critical Information Infrastructures, Web Science und Wissensmanagement, Web Science, Ökonomie und Technologie der eOrganisation, ...) zulässiger Werte für das Attribut „Forschungsgruppe“.


Forschungsgebiet

Ameisenalgorithmen, Rekonfigurierbarkeit, Rechnerarchitektur