Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Distributed Loads: Problem Solving01:21

Distributed Loads: Problem Solving

1.1K
Beams are structural elements commonly employed in engineering applications requiring different load-carrying capacities. The first step in analyzing a beam under a distributed load is to simplify the problem by dividing the load into smaller regions, which allows one to consider each region separately and calculate the magnitude of the equivalent resultant load acting on each portion of the beam. The magnitude of the equivalent resultant load for each region can be determined by calculating...
1.1K
Maxwell-Boltzmann Distribution: Problem Solving01:20

Maxwell-Boltzmann Distribution: Problem Solving

2.9K
Individual molecules in a gas move in random directions, but a gas containing numerous molecules has a predictable distribution of molecular speeds, which is known as the Maxwell-Boltzmann distribution, f(v).
This distribution function f(v) is defined by saying that the expected number N (v1,v2) of particles with speeds between v1 and v2 is given by
2.9K
Constraints and Statical Determinacy01:26

Constraints and Statical Determinacy

1.0K
In structural engineering, the equilibrium of a system is not only determined by its equations of equilibrium but also with the help of constraints. Constraints refer to restrictions on the motion of a system. The proper combinations of constraints can minimize the total number of constraints needed to maintain a system in mechanical equilibrium. When this happens, the system is said to be statically determinate. For such systems, the unknown reaction supports can be estimated using equilibrium...
1.0K
Protein Networks02:26

Protein Networks

4.6K
An organism can have thousands of different proteins, and these proteins must cooperate to ensure the health of an organism. Proteins bind to other proteins and form complexes to carry out their functions. Many proteins interact with multiple other proteins creating a complex network of protein interactions.
These interactions can be represented through maps depicting protein-protein interaction networks, represented as nodes and edges. Nodes are circles that are representative of a protein,...
4.6K
Protein Networks02:26

Protein Networks

2.9K
2.9K
Network Covalent Solids02:18

Network Covalent Solids

16.2K
Network covalent solids contain a three-dimensional network of covalently bonded atoms as found in the crystal structures of nonmetals like diamond, graphite, silicon, and some covalent compounds, such as silicon dioxide (sand) and silicon carbide (carborundum, the abrasive on sandpaper). Many minerals have networks of covalent bonds.
To break or to melt a covalent network solid, covalent bonds must be broken. Because covalent bonds are relatively strong, covalent network solids are typically...
16.2K

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Hierarchical learning creates invariant schema within plastic neural networks.

Journal of computational neuroscience·2026
Same author

Microstimulation of the human dopaminergic midbrain enhances outcome-related happiness and reduces loss seeking.

bioRxiv : the preprint server for biology·2026
Same author

A lineage-based model of scalable positional information in vertebrate brain development.

Neuron·2026
Same author

Verbally specified task goals reorganize visual codes in human ventral temporal cortex via medial frontal modulation.

bioRxiv : the preprint server for biology·2026
Same author

Time Cells in the Human Brain Support Working Memory Maintenance.

bioRxiv : the preprint server for biology·2026
Same author

Single-Neuron Recordings Research in Children: Ethical Considerations, Feasibility, Technical Aspects, and Scientific Opportunities.

Pediatric neurosurgery·2025
Same journal

A Model-Free Reinforcement Learning Implementation of Decision Making Under Uncertainty by Sequential Sampling.

Neural computation·2026
Same journal

DROP: Distributional and Regular Optimism and Pessimism for Reinforcement Learning.

Neural computation·2026
Same journal

Hierarchical Active Inference Using Successor Representations.

Neural computation·2026
Same journal

W-Kernel and Its Principal Space for Frequentist Evaluation of Bayesian Estimators.

Neural computation·2026
Same journal

A Hidden Markov Model-Inspired Sequence Classification Method for Hyperdimensional Computing.

Neural computation·2026
Same journal

Sparse Graphical Modeling for Electrophysiological Phase-Based Connectivity Using Circular Statistics.

Neural computation·2026
See all related articles

Related Experiment Video

Updated: Feb 12, 2026

Widespread Transduction of Mouse Neocortical Neurons by Subarachnoid Injection of AAV2
07:40

Widespread Transduction of Mouse Neocortical Neurons by Subarachnoid Injection of AAV2

Published on: May 23, 2025

1.1K

Solving Constraint-Satisfaction Problems with Distributed Neocortical-Like Neuronal Networks.

Ueli Rutishauser1, Jean-Jacques Slotine2, Rodney J Douglas3

  • 1Computation and Neural Systems, Division of Biology and Biological Engineering, California Institute of Technology, Pasadena, CA 91125, U.S.A., and Cedars-Sinai Medical Center, Departments of Neurosurgery, Neurology and Biomedical Sciences, Los Angeles, CA 90048, U.S.A. urut@caltech.edu.

Neural Computation
|March 23, 2018
PubMed
Summary
This summary is machine-generated.

This study shows how neural networks can solve complex constraint satisfaction problems (CSPs) using cooperative-competitive modules. The findings highlight the role of network instability and dual inhibition in decision-making processes.

More Related Videos

Closed-loop Neuro-robotic Experiments to Test Computational Properties of Neuronal Networks
11:18

Closed-loop Neuro-robotic Experiments to Test Computational Properties of Neuronal Networks

Published on: March 2, 2015

10.9K
How to Culture, Record and Stimulate Neuronal Networks on Micro-electrode Arrays MEAs
09:27

How to Culture, Record and Stimulate Neuronal Networks on Micro-electrode Arrays MEAs

Published on: May 30, 2010

55.9K

Related Experiment Videos

Last Updated: Feb 12, 2026

Widespread Transduction of Mouse Neocortical Neurons by Subarachnoid Injection of AAV2
07:40

Widespread Transduction of Mouse Neocortical Neurons by Subarachnoid Injection of AAV2

Published on: May 23, 2025

1.1K
Closed-loop Neuro-robotic Experiments to Test Computational Properties of Neuronal Networks
11:18

Closed-loop Neuro-robotic Experiments to Test Computational Properties of Neuronal Networks

Published on: March 2, 2015

10.9K
How to Culture, Record and Stimulate Neuronal Networks on Micro-electrode Arrays MEAs
09:27

How to Culture, Record and Stimulate Neuronal Networks on Micro-electrode Arrays MEAs

Published on: May 30, 2010

55.9K

Area of Science:

  • Computational Neuroscience
  • Artificial Intelligence
  • Cognitive Science

Background:

  • Decision-making relies on satisfying constraints from external and internal sources.
  • Constraint satisfaction problems (CSPs) are fundamental in various computational and cognitive tasks.

Purpose of the Study:

  • To demonstrate that specific classes of CSPs can be solved using neural networks with neocortical-like connectivity.
  • To explore the computational principles underlying decision-making in neural circuits.

Main Methods:

  • Designing networks of homogeneous cooperative-competitive modules with winner-take-all dynamics.
  • Utilizing programming neurons to embed constraints for problems like graph coloring, maximum independent set, and Sudoku.
  • Employing nonsaturating linear threshold neurons and analyzing network dynamics, including recurrent excitation and inhibition.

Main Results:

  • Successfully mapped CSPs, including planar four-color graph coloring, maximum independent set, and Sudoku, onto the proposed neural substrate.
  • Provided mathematical proofs for the convergence of graph coloring problems.
  • Demonstrated that network instability, driven by recurrent excitation, is crucial for exploring the problem space.
  • Showed performance benefits for hard problems using nonlinear multiplicative inhibition compared to linear inhibition.

Conclusions:

  • Neural networks with specific modular and connectivity patterns can solve complex constraint satisfaction problems.
  • Network instability and dual inhibitory mechanisms (linear and nonlinear) are vital for efficient neural computation and decision-making.