✦ LIBER ✦

Copy distribution stages for broadband broadcast connecting networks

✍ Scribed by Toru Maruta Member; Yusheng Ji; Shoichiro Asano

Publisher: John Wiley and Sons
Year: 1993
Tongue: English
Weight: 530 KB
Volume: 76
Category: Article
ISSN: 8756-6621
DOI: 10.1002/ecja.4410760704

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Transition models for the number of broa

Transition models for the number of broadcast viewers in broadband integrated services digital network

✍ Yoshiaki Tanaka; Tetsuya Usui 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 736 KB

Batcher Banyan network with cell copy pr

Batcher Banyan network with cell copy preparation stages for multicast switching

✍ Shin'ichi Takagi; Yoshiaki Tanaka; Hideyoshi Tominaga 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 282 KB

A Parallel Algorithm for Traffic Control

A Parallel Algorithm for Traffic Control Problems in Three-Stage Connecting Networks

✍ N. Funabiki; Y. Takefuji 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 403 KB

Acyclic k-connected subgraphs for distri

Acyclic k-connected subgraphs for distributed alternate routing in communications networks

✍ Moshe Segal; Donald M. Topkis 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 712 KB

Flexible framework for the operation of

Flexible framework for the operation of distribution networks: synchronizing and connecting grid areas using multi back-to-back converters

✍ R. A. A. de Graaff; J. L. Duarte; W. L. Kling; P. T. M. Vaessen 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 293 KB

Closure, connectivity and degree distrib

Closure, connectivity and degree distributions: Exponential random graph (p*) models for directed social networks

✍ Garry Robins; Pip Pattison; Peng Wang 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 1005 KB

New specifications for exponential random graph models. Sociological Methodology 36, exhibit substantial improvements in model fit compared with the commonly used Markov random graph models. Snijders et al., however, concentrated on non-directed graphs, with only limited extensions to directed graph