Minimal Addition-Subtraction Chains with Ant Colony

Addition-subtraction chains (AS-chains) consist of a sequence of integers that allow one to efficiently compute power TE, where T varies but E is constant. The shorter the AS-chain is, the more efficient the computation. Solving the minimisation problem that yields the shortest addition-subtraction...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Nedjah, Nadia, de Macedo Mourelle, Luiza
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Applied sciences Artificial intelligence Computer science control theory systems Exact sciences and technology Genetic Algorithm Local Memory Pheromone Trail Problem solving, game playing Shared Memory Travelling Salesman Problem
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	Addition-subtraction chains (AS-chains) consist of a sequence of integers that allow one to efficiently compute power TE, where T varies but E is constant. The shorter the AS-chain is, the more efficient the computation. Solving the minimisation problem that yields the shortest addition-subtraction is NP-hard. There exists some heuristics that attempt to obtain reduced AS-chains. In this paper, we compute minimal addition- subtraction chains using the ant-colony methodology.
ISSN:	0302-9743 1611-3349
DOI:	10.1007/978-3-540-30499-9_168