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

Fast combinatorial optimization with parallel digital computers.

H Kakeya1, Y Okabe

  • 1Communications Research Laboratory, Ministry of Posts and Telecommunications, Tokyo 184-8795, Japan. kake@crl.go.jp

IEEE Transactions on Neural Networks
|February 6, 2008
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

Predictors for onset of extended-spectrum beta-lactamase-producing Escherichia coli-induced bacteraemia: a systematic review and meta-analysis.

The Journal of hospital infection·2023
Same author

Predictors of hypervirulent Klebsiella pneumoniae infections: a systematic review and meta-analysis.

The Journal of hospital infection·2023
Same author

Long COVID with intracranial microangiopathy.

QJM : monthly journal of the Association of Physicians·2022
Same author

Adequate Protein Intake on Comprehensive Frailty in Older Adults: Kyoto-Kameoka Study.

The journal of nutrition, health & aging·2022
Same author

In which cases of pneumonia should we consider treatments for Stenotrophomonas maltophilia?

The Journal of hospital infection·2021
Same author

Coronavirus disease with multiple infarctions.

QJM : monthly journal of the Association of Physicians·2020
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 a novel algorithm for faster combinatorial optimization on parallel computers. By modifying weight matrices, it reduces oscillations and speeds up convergence to quasi-optimal solutions.

Area of Science:

  • Computer Science
  • Applied Mathematics
  • Algorithm Design

Background:

  • Combinatorial optimization problems often require extensive computation.
  • Conventional algorithms using standard weight matrices necessitate many iterations for convergence, even with parallel processing.

Purpose of the Study:

  • To present a novel algorithm for accelerating the search for solutions to combinatorial optimization problems.
  • To enhance the efficiency of parallel digital computers in solving these problems.

Main Methods:

  • The proposed algorithm modifies weight matrices by removing components associated with eminent negative eigenvalues.
  • This approach is designed to avoid oscillation and reduce energy under synchronous discrete dynamics.

Main Results:

Related Experiment Videos

  • The modified algorithm demonstrates faster convergence to quasi-optimal solutions compared to conventional methods.
  • It significantly reduces the time required for parallel digital computers to find approximate solutions.

Conclusions:

  • The developed algorithm offers a more efficient approach to solving combinatorial optimization problems using parallel computing.
  • This method overcomes limitations of traditional algorithms by preventing oscillations and accelerating convergence.