The shortest path computation in MOSPF protocol using an annealed Hopfield neural network with a new cooling schedule

DOI10.1016/S0020-0255(00)00071-2zbMath0981.68744OpenAlexW2040677995MaRDI QIDQ5946278

Mingshou Liu, Nen-Fu Huang, Jzau-Sheng Lin

Publication date: 18 March 2002

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0255(00)00071-2

zbMATH Keywords

Hopfield neural networkvideo conferencingvideo on demand

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35) Network protocols (68M12)

Related Items (1)

Dynamic threshold P systems with delay on synapses for shortest path problems

Cites Work

• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Optimization by Simulated Annealing
• Experiments in projection and clustering by simulated annealing
• ``Neural computation of decisions in optimization problems
• Collective Computation With Continuous Variables
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
• Neural networks and physical systems with emergent collective computational abilities.

This page was built for publication: The shortest path computation in MOSPF protocol using an annealed Hopfield neural network with a new cooling schedule