Abstract
Neural networks can be used to describe symbolic algorithms like those specified in high-level programming languages. This article shows how to translate these network description of algorithms into a more suitable format in order to feed an arbitrary number of parallel processors to speed-up the computation of sequential and parallel algorithms. © 2011 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Neto, J. P., & Silva, F. (2011). Parallelization of algorithms with recurrent neural networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6593 LNCS, pp. 61–69). https://doi.org/10.1007/978-3-642-20282-7_7
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
