𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The intractability of the reliable assignment problem in split networks

✍ Scribed by Constantine Stivaros; Klaus Sutner


Publisher
John Wiley and Sons
Year
1995
Tongue
English
Weight
647 KB
Volume
26
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Use of neural networks for the optimum f
✍ Takakazu Kurokawa; Shigeki Kozuka πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 860 KB

## Introduction When two satellites in close proximity to each other use the same frequency band, mutual signal interference is unavoidable. Especially, it is known in the FDMA communication system that the interference to each carrier and the total interference depends greatly on the carrier freq

The structure of max ?-minm?+1 graphs us
✍ Wang, Guifang; Zhang, Lianzhu πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 235 KB πŸ‘ 1 views

It was proved that the design problem of the reliable networks for ''small'' edge failure probability is equivalent to finding a max l-min m l graph for given numbers of nodes n and edges e with l Γ… [2e/n] by Bauer et al. Furthermore, at least a max l-min m l graph was given for each pair of n and e

On the assignment of proton hyperfine sp
✍ J. Nowakowski πŸ“‚ Article πŸ“… 1972 πŸ› Elsevier Science 🌐 English βš– 133 KB

The assignment of proton hyperfine splitting constants in benzo [cd ] pyrenyl has been discussed with the aid of some variants of McLachlan's method and blcConnell's relationship. The proton hyperfine splitting constants for benzo [cd] pytenyl (fig. i) have been determined by Reddoch and Paskovich [