Skip to main content
SpringerLink
Log in

Minimal Addition-Subtraction Chains with Ant Colony

  • Conference paper
Neural Information Processing (ICONIP 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3316))

Included in the following conference series:

Abstract

Addition-subtraction chains (AS-chains) consist of a sequence of integers that allow one to efficiently compute power T E, 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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Rivest, R., Shamir, A., Adleman, L.: A method for Obtaining Digital Signature and Public-Key Cryptosystems. Communications of the ACM (21), 120–126 (1978)

    Google Scholar 

  2. Dorigo, M., Gambardella, L.M.: Ant Colony: A Cooperative Learning Approach to the Travelling Salesman Problem. IEEE Transaction on Evolutionary Computation 1(1), 53–66 (1997)

    Article  Google Scholar 

  3. Feber, J.: Multi-Agent Systems: an Introduction to Distributed Artificial Intelligence. Addison-Wesley, Reading (1995)

    Google Scholar 

  4. Downing, P., Leong, B., Sthi, R.: Computing Sequences with Addition Chains. SIAM Journal on Computing 3(10), 638–646 (1981)

    Google Scholar 

  5. Nedjah, N., Mourelle, L.M.: Efficient Parallel Modular Exponentiation Algorithm. In: Yakhno, T. (ed.) ADVIS 2002. LNCS, vol. 2457, pp. 405–414. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  6. Stutzle, T., Dorigo, M.: ACO Algorithms for the Travelling Salesman Problems. In: Evolutionary Algorithms in Engineering and Computer Science. John Wiley, Chichester (1999)

    Google Scholar 

  7. Nedjah, N., Mourelle, L.M.: Minimal addition-subtraction chains using genetic algorithms. In: Yakhno, T. (ed.) ADVIS 2002. LNCS, vol. 2457, pp. 303–313. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Systems Engineering and Computation, Faculty of Engineering, State University of Rio de Janeiro, Brazil

    Nadia Nedjah & Luiza de Macedo Mourelle

Authors
  1. Nadia Nedjah
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Luiza de Macedo Mourelle
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Indian Statistical Institute, Electronics and Communication Sciences Unit, Kolkata, India

    Nikhil Ranjan Pal

  2. School of Computer and Information Sciences, Knowledge Engineering and Discovery Research Institute (KEDRI), Auckland University of Technology, Private Bag 92006, Auckland, New Zealand

    Nik Kasabov

  3. Department of Instrumentation and Electronics Engineering, Jadavpur University, Salt-lake Campus, 700098, Calcutta, India

    Rajani K. Mudi

  4. Indian Statistical Institute, 203 B. T. Road, 700 108, Calcutta,  

    Srimanta Pal

  5. Indian Statistical Institute, Computer Vision and Pattern Recognition Unit, 700108, Kolkata, India

    Swapan Kumar Parui

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nedjah, N., de Macedo Mourelle, L. (2004). Minimal Addition-Subtraction Chains with Ant Colony. In: Pal, N.R., Kasabov, N., Mudi, R.K., Pal, S., Parui, S.K. (eds) Neural Information Processing. ICONIP 2004. Lecture Notes in Computer Science, vol 3316. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30499-9_168

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30499-9_168

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23931-4

  • Online ISBN: 978-3-540-30499-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation