Using Stochastic Spiking Neural Networks on SpiNNaker to Solve Constraint Satisfaction Problems

Constraint satisfaction problems (CSP) are at the core of numerous scientific and technological applications. However, CSPs belong to the NP-complete complexity class, for which the existence (or not) of efficient algorithms remains a major unsolved question in computational complexity theory. In th...

Descripción completa

Detalles Bibliográficos
Autores principales: Fonseca Guerra, Gabriel A., Furber, Steve B.
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Frontiers Media S.A. 2017
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5742150/
https://www.ncbi.nlm.nih.gov/pubmed/29311791
http://dx.doi.org/10.3389/fnins.2017.00714