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

Primal and dual assignment networks.

J Wang1

  • 1Dept. of Mech. and Autom. Eng., Chinese Univ. of Hong Kong, Shatin.

IEEE Transactions on Neural Networks
|January 1, 1997
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

Reaction of cytochrome bo3 with oxygen: extra redox center(s) are present in the protein.

Biochemistry·1995
Same author

Regulation of striatal cyclic-3',5'-adenosine monophosphate accumulation and GABA release by glutamate metabotropic and dopamine D1 receptors.

The Journal of pharmacology and experimental therapeutics·1995
Same author

Calculation of relative binding free energies and configurational entropies: a structural and thermodynamic analysis of the nature of non-polar binding of thrombin inhibitors based on hirudin55-65.

Journal of molecular biology·1995
Same author

Hydroxylated aromatic inhibitors of HIV-1 integrase.

Journal of medicinal chemistry·1995
Same author

Sevoflurane for outpatient anesthesia: a comparison with propofol.

Anesthesia and analgesia·1995
Same author

Resident bone marrow macrophages produce type 1 interferons that can selectively inhibit interleukin-7-driven growth of B lineage cells.

Immunity·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 introduces two novel recurrent neural networks for optimal assignment problem solutions. These networks, the primal and dual assignment networks, offer simplified architectures and proven optimal assignment capabilities.

Area of Science:

  • Artificial Intelligence
  • Machine Learning
  • Operations Research

Background:

  • The assignment problem is a fundamental combinatorial optimization task.
  • Existing recurrent neural network (RNN) approaches for the assignment problem can be complex.
  • There is a need for more efficient and simpler RNN architectures.

Purpose of the Study:

  • To present two novel recurrent neural networks for solving the assignment problem.
  • To introduce simplified RNN architectures for enhanced computational efficiency.
  • To demonstrate the optimal assignment capabilities of the proposed networks.

Main Methods:

  • Development of a primal assignment network based on the primal assignment problem.
  • Development of a dual assignment network based on the dual assignment problem, featuring a simpler architecture.

Related Experiment Videos

  • Analysis of network connectivity and architectural complexity.

    • Main Results:

    • The primal assignment network offers reduced architectural complexity compared to predecessors.
    • The dual assignment network presents an even simpler architecture while guaranteeing optimal assignments.
    • The proposed networks are theoretically guaranteed to achieve optimal solutions.

    Conclusions:

    • The primal and dual assignment networks provide efficient and effective solutions for the assignment problem.
    • These networks have potential applications in areas like sorting and shortest-path routing.
    • The dual assignment network's performance is validated through illustrative examples.