Nalaganje...

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...

Popoln opis

Shranjeno v:
Bibliografske podrobnosti
izdano v:Front Neurosci
Main Authors: Fonseca Guerra, Gabriel A., Furber, Steve B.
Format: Artigo
Jezik:Inglês
Izdano: Frontiers Media S.A. 2017
Teme:
Online dostop:https://ncbi.nlm.nih.gov/pmc/articles/PMC5742150/
https://ncbi.nlm.nih.gov/pubmed/29311791
https://ncbi.nlm.nih.govhttp://dx.doi.org/10.3389/fnins.2017.00714
Oznake: Označite
Brez oznak, prvi označite!