𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computational algorithms for hierarchically structured project networks

✍ Scribed by M. Ancona; L. De Floriani


Publisher
Elsevier Science
Year
1982
Tongue
English
Weight
537 KB
Volume
1
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Algorithms for computing message delay f
✍ AboElFotoh, Hosam M. F. πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 114 KB

In this paper, we consider the problem of computing the expected message delay in a wireless network where nodes are subject to random failures. The failure of one or more nodes in the network may increase the number of repeaters the message has to go through before reaching its destination. Therefo

Fast Spectral Projection Algorithms for
✍ Gregory Beylkin; Nicholas Coult; Martin J Mohlenkamp πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 196 KB

We present a fast algorithm for the construction of a spectral projector. This algorithm allows us to compute the density matrix, as used in, e.g., the Kohn-Sham iteration, and so obtain the electron density. We compute the spectral projector by constructing the matrix sign function through a simple