✦ LIBER ✦

Shortest path routing algorithm using Hopfield neural network

✍ Scribed by Ahn, C.W.; Ramakrishna, R.S.; Kang, C.G.; Choi, I.C.

Book ID: 121190790
Publisher: The Institution of Electrical Engineers
Year: 2001
Tongue: English
Weight: 377 KB
Volume: 37
Category: Article
ISSN: 0013-5194
DOI: 10.1049/el:20010800

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A hill-jump algorithm of Hopfield neural

A hill-jump algorithm of Hopfield neural network for shortest path problem in communication network

✍ Rong-Long Wang; Shan-Shan Guo; Kozo Okazaki 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 314 KB

A discrete-time recurrent neural network

A discrete-time recurrent neural network for shortest-path routing

✍ Jun Wang, ; Youshen Xia, 📂 Article 📅 2000 🏛 IEEE 🌐 English ⚖ 188 KB

Primal and dual neural networks for shor

Primal and dual neural networks for shortest-path routing

✍ Jun Wang 📂 Article 📅 1998 🏛 IEEE 🌐 English ⚖ 183 KB

A routing algorithm with candidate short

A routing algorithm with candidate shortest path

✍ Qijing Pan 📂 Article 📅 1986 🏛 Springer 🌐 English ⚖ 881 KB

A loop-free shortest-path routing algori

A loop-free shortest-path routing algorithm for dynamic networks

✍ DʼAngelo, Gianlorenzo; DʼEmidio, Mattia; Frigioni, Daniele 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 598 KB

Shortest-Path Routing in Arbitrary Netwo

Shortest-Path Routing in Arbitrary Networks

✍ Friedhelm Meyer auf der Heide; Berthold Vöcking 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 197 KB

We introduce an on-line protocol which routes any set of N packets along shortest paths with congestion C and dilation D through an arbitrary network in Ž . O C q D q log N steps, with high probability. This time bound is optimal up to the additive log N, and it has previously only been reached for