✦ LIBER ✦

Primal and dual neural networks for shortest-path routing

✍ Scribed by Jun Wang

Book ID: 117873974
Publisher: IEEE
Year: 1998
Tongue: English
Weight: 183 KB
Volume: 28
Category: Article
ISSN: 1083-4427
DOI: 10.1109/3468.725357

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Shortest path routing algorithm using Ho

Shortest path routing algorithm using Hopfield neural network

✍ Ahn, C.W.; Ramakrishna, R.S.; Kang, C.G.; Choi, I.C. 📂 Article 📅 2001 🏛 The Institution of Electrical Engineers 🌐 English ⚖ 377 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

On a parametric shortest path problem fr

On a parametric shortest path problem from primal—dual multicommodity network optimization

✍ George G. Polak 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 646 KB

Optimal routing in shortest-path data ne

Optimal routing in shortest-path data networks

✍ K. G. Ramakrishnan; Manoel A. Rodrigues 📂 Article 📅 2002 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 249 KB 👁 1 views

A neural network for shortest path compu

A neural network for shortest path computation

✍ Araujo, F.; Ribeiro, B.; Rodrigues, L. 📂 Article 📅 2001 🏛 IEEE 🌐 English ⚖ 150 KB

Shortest path routing and fault-tolerant

Shortest path routing and fault-tolerant routing on de Bruijn networks

✍ Mao, Jyh-Wen; Yang, Chang-Biau 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 170 KB 👁 1 views

In this paper, we study the routing problem for the undirected binary de Bruijn interconnection network. Researchers have never proposed a shortest path routing algorithm on the undirected binary de Bruijn network. We first propose a shortest path routing algorithm, whose time complexity in the bina