Abstract
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. © Springer-Verlag Berlin Heidelberg 2004.
Cite
CITATION STYLE
Nedjah, N., & Mourelle, L. D. M. (2004). Minimal addition-subtraction chains with ant colony. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3316, 1082–1087. https://doi.org/10.1007/978-3-540-30499-9_168
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
