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 Experiment Videos

Inhibitory grids and the assignment problem.

W J Wolfe1, J M Macmillan, G Brady

  • 1Dept. of Comput. Sci. and Eng., Colorado Univ., Denver, CO.

IEEE Transactions on Neural Networks
|January 1, 1993
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

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

Sort by
Same author

Comparison of sputum induction with fiber-optic bronchoscopy in the diagnosis of tuberculosis.

American journal of respiratory and critical care medicine·1995
Same author

Metabolic requirements for induction of contact hypersensitivity to immunotoxic polyaromatic hydrocarbons.

Journal of immunology (Baltimore, Md. : 1950)·1995
Same author

Nerves containing nitric oxide synthase and their possible function in the control of catecholamine secretion in the bovine adrenal medulla.

Journal of the autonomic nervous system·1995
Same author

Echocardiographic-morphologic correlations in tricuspid atresia.

Journal of the American College of Cardiology·1995
Same author

Drawing serum haptoglobin levels to determine hemolysis due to use of an incorrect reprocessed dialyzer.

ANNA journal·1995
Same author

Diode laser treatment for retinopathy of prematurity: structural and functional outcome.

The British journal of ophthalmology·1995
Same journal

Universal perceptron and DNA-like learning algorithm for binary neural networks: LSBF and PBF implementations.

IEEE transactions on neural networks·2013
Same journal

Guest editorial: special section on white box nonlinear prediction models.

IEEE transactions on neural networks·2011
Same journal

Data-based fault-tolerant control of high-speed trains with traction/braking notch nonlinearities and actuator failures.

IEEE transactions on neural networks·2011
Same journal

Guest editorial: special section on data-based control, modeling, and optimization.

IEEE transactions on neural networks·2011
Same journal

Neural network-based multiple robot simultaneous localization and mapping.

IEEE transactions on neural networks·2011
Same journal

Data-driven model-free adaptive control for a class of MIMO nonlinear discrete-time systems.

IEEE transactions on neural networks·2011
See all related articles

This study analyzes symmetric neural networks for the assignment problem (AP). New parameters and a projection algorithm achieve 100% feasible solutions, improving performance over existing models.

Area of Science:

  • Computational Neuroscience
  • Operations Research
  • Artificial Intelligence

Background:

  • Symmetric neural networks offer a potential approach to solving the assignment problem (AP).
  • Previous network models exhibited suboptimal performance compared to linear programming solutions.
  • Understanding network dynamics is crucial for improving AP solutions.

Purpose of the Study:

  • To analyze the performance of symmetric neural networks on a simplified assignment problem.
  • To identify network parameters and algorithms for achieving optimal or near-optimal solutions.
  • To compare neural network approaches with established linear programming techniques.

Main Methods:

  • Analysis of network dynamics using the interactive activation model, related to the Hopfield-Tank model.

Related Experiment Videos

  • Systematic investigation of hypercube corner stability and eigenspaces of the connection strength matrix.
  • Development of a projection algorithm to enhance network performance.

    • Main Results:

    • Identified specific network parameters enabling 100% feasible solutions for the assignment problem.
    • Demonstrated significant performance improvements through a novel projection algorithm.
    • Compared two problem formulations: nearest corner (initial activations) and lowest energy corner (external inputs).

    Conclusions:

    • Optimized symmetric neural networks can reliably solve simplified assignment problems.
    • The proposed projection algorithm enhances the efficiency and accuracy of neural network solutions.
    • This work provides a foundation for applying neural networks to combinatorial optimization problems.