𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A fast algorithm for the performance index of a telecommunication network

✍ Scribed by Aggarwal, K.K.

Book ID
114555307
Publisher
IEEE
Year
1988
Tongue
English
Weight
461 KB
Volume
37
Category
Article
ISSN
0018-9529

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A fast algorithm for index of annihilati
A fast algorithm for index of annihilation computations
✍ P.Y. Yalamov; M. Mitrouli πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 110 KB

In this paper a fast algorithm for computing the index of annihilation of the associated pencil of a given matrix is presented. Knowledge of this index leads us to the speciΓΏcation of the elementary divisors of the matrix and thus we can specify its canonical forms. It is shown that the new algorith

A new proximal decomposition algorithm f
A new proximal decomposition algorithm for routing in telecommunication networks
✍ Mahey, P.; Ouorou, A.; LeBlanc, L.; Chifflet, J. πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 125 KB πŸ‘ 2 views

We present a new and much more efficient implementation of the proximal decomposition algorithm for routing in congested telecommunication networks. The routing model that we analyze is a static one intended for use as a subproblem in a network design context. After describing our new implementation