Solving Constraint-Satisfaction Problems with Distributed Neocortical-Like Neuronal Networks
From MaRDI portal
Publication:5157180
DOI10.1162/neco_a_01074zbMath1472.68056DBLPjournals/neco/RutishauserSD18arXiv1801.04515OpenAlexW2963821348WikidataQ51556530 ScholiaQ51556530MaRDI QIDQ5157180
Rodney J. Douglas, Jean-Jacques E. Slotine, Ueli Rutishauser
Publication date: 12 October 2021
Published in: Neural Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1801.04515
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Networks and circuits as models of computation; circuit complexity (68Q06)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- ``Neural computation of decisions in optimization problems
- Every planar map is four colorable. II: Reducibility
- Heavy-tailed phenomena in satisfiability and constraint satisfaction problems
- A review on algorithms for maximum clique problems
- A Competitive-Layer Model for Feature Binding and Sensory Segmentation
- Collective Stability of Networks of Winner-Take-All Circuits
- A Biological Solution to a Fundamental Distributed Computing Problem
- A Systematic Method for Configuring VLSI Networks of Spiking Neurons
- State-Dependent Computation Using Coupled Recurrent Networks
- Matrix Analysis
- Scene Labeling by Relaxation Operations
- Modular stability tools for distributed computation and control
- Control system design for mechanical systems using contraction theory
- Theory of cortical function
- HETEROCLINIC CONTOURS IN NEURAL ENSEMBLES AND THE WINNERLESS COMPETITION PRINCIPLE
- Reducibility among Combinatorial Problems
- Neural networks and physical systems with emergent collective computational abilities.
This page was built for publication: Solving Constraint-Satisfaction Problems with Distributed Neocortical-Like Neuronal Networks
