{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T11:39:06Z","timestamp":1725622746725},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2006,5,24]],"date-time":"2006-05-24T00:00:00Z","timestamp":1148428800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Math Model Algor"],"published-print":{"date-parts":[[2006,12]]},"DOI":"10.1007\/s10852-005-9024-z","type":"journal-article","created":{"date-parts":[[2006,5,24]],"date-time":"2006-05-24T10:45:49Z","timestamp":1148467549000},"page":"525-543","source":"Crossref","is-referenced-by-count":14,"title":["Towards Minimal Addition Chains Using Ant Colony Optimisation"],"prefix":"10.1007","volume":"5","author":[{"given":"Nadia","family":"Nedjah","sequence":"first","affiliation":[]},{"given":"Luiza","family":"de Macedo Mourelle","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,24]]},"reference":[{"key":"9024_CR1","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/0196-6774(89)90036-9","volume":"10","author":"R. Begeron","year":"1989","unstructured":"Begeron, R., Berstel, J., Brlek, S. and Duboc, C.: Addition chains using continued fractions, J. Algorithms 10 (1989), 403\u2013412.","journal-title":"J. Algorithms"},{"key":"9024_CR2","volume-title":"Handbook of Genetic Algorithms","author":"L. Davis","year":"1991","unstructured":"Davis, L.: Handbook of Genetic Algorithms, Van Nostrand Reinhold, New York, 1991."},{"key":"9024_CR3","doi-asserted-by":"crossref","first-page":"845","DOI":"10.1214\/aos\/1176349634","volume":"13","author":"P. Diaconis","year":"1985","unstructured":"Diaconis, P. and Efron, B.: Testing for independence in a two-way table: new interpretations of the chi-square statistic (with discussion), Ann. Stat. 13 (1985), 845\u2013913.","journal-title":"Ann. Stat."},{"issue":"1","key":"9024_CR4","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M. Dorigo","year":"1997","unstructured":"Dorigo, M. and Gambardella, L. M.: Ant colony: a cooperative learning approach to the travelling salesman problem, IEEE Trans. Evol. Comput. 1(1) (1997), 53\u201366.","journal-title":"IEEE Trans. Evol. Comput."},{"key":"9024_CR5","doi-asserted-by":"crossref","unstructured":"Dorigo, M. and Stutzle, T.: Ant Colony Optimisation, MIT Press, 2004.","DOI":"10.7551\/mitpress\/1290.001.0001"},{"issue":"3","key":"9024_CR6","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1137\/0210047","volume":"10","author":"P. Downing","year":"1981","unstructured":"Downing, P., Leong, B. and Sthi, R.: Computing sequences with addition chains, SIAM J. Comput. 10(3) (1981), 638\u2013646.","journal-title":"SIAM J. Comput."},{"key":"9024_CR7","unstructured":"Feber, J.: Multi-Agent Systems: an Introduction to Distributed Artificial Intelligence, Addison-Wesley, 1995."},{"key":"9024_CR8","unstructured":"Haupt, R. L. and Haupt, S. E.: Practical Genetic Algorithms, Wiley, 1998."},{"key":"9024_CR9","volume-title":"The Art of Programming: Semi-numerical Algorithms, Vol. 2","author":"D. E. Knuth","year":"1981","unstructured":"Knuth, D. E.: The Art of Programming: Semi-numerical Algorithms, Vol. 2, 2nd edn, Addison-Wesley, Reading, MA, 1981.","edition":"2"},{"key":"9024_CR10","unstructured":"Ko\u00e7, \u00c7. K.: High-speed RSA Implementation, Technical report, RSA Laboratories, Redwood City, California, USA, November 1994."},{"issue":"1","key":"9024_CR11","first-page":"60","volume":"E83-A","author":"N. Kunihiro","year":"January 2000","unstructured":"Kunihiro, N. and Yamamoto, H.: New methods for generating short addition chain, IEICE Trans. E83-A(1) (January 2000), 60\u201367.","journal-title":"IEICE Trans."},{"key":"9024_CR12","doi-asserted-by":"crossref","unstructured":"Menezes, A. J., Van Oorschot, P. C. and Vanstone, S. A.: Handbook of Applied Cryptography, CRC, 1996.","DOI":"10.1201\/9781439821916"},{"key":"9024_CR13","doi-asserted-by":"crossref","unstructured":"Nedjah, N. and Mourelle, L. M.: Efficient parallel modular exponentiation algorithm, in Second International Conference on Information Systems, Lecture Notes in Computer Science, Vol. 2457, Springer, 2002, pp. 405\u2013414.","DOI":"10.1007\/3-540-36077-8_43"},{"key":"9024_CR14","unstructured":"Nedjah, N. and Mourelle, L. M.: Minimal addition chains using genetic algorithms, in Proceedings of the Fifteenth International Conference on Industrial & Engineering Applications of Artificial Intelligence & Expert Systems, Lecture Notes in Computer Science, Vol. 2358, Springer, 2002, pp. 88\u201398."},{"key":"9024_CR15","doi-asserted-by":"crossref","unstructured":"Nedjah, N. and Mourelle, L. M.: Efficient pre-processing for large window-based modular exponentiation using genetic algorithms, in Proceedings of the Sixteenth International Conference on Industrial & Engineering Applications of Artificial Intelligence & Expert Systems, Lecture Notes in Computer Science, Vol. 2718, Springer, 2003, pp. 625\u2013635.","DOI":"10.1007\/3-540-45034-3_63"},{"key":"9024_CR16","doi-asserted-by":"crossref","unstructured":"Rivest, R., Shamir, A. and Adleman, L.: A method for obtaining digital signature and public-key cryptosystems, Commun. ACM (21) (1978), 120\u2013126.","DOI":"10.1145\/359340.359342"},{"key":"9024_CR17","unstructured":"Stutzle, T. and Dorigo, M.: ACO Algorithms for the Travelling Salesman Problems, Evolutionary Algorithms in Engineering and Computer Science, Wiley, 1999."}],"container-title":["Journal of Mathematical Modelling and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-005-9024-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10852-005-9024-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-005-9024-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T02:26:29Z","timestamp":1559269589000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10852-005-9024-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,5,24]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2006,12]]}},"alternative-id":["9024"],"URL":"https:\/\/doi.org\/10.1007\/s10852-005-9024-z","relation":{},"ISSN":["1570-1166","1572-9214"],"issn-type":[{"value":"1570-1166","type":"print"},{"value":"1572-9214","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,5,24]]}}}