𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Reducing complexity in tree-like computer interconnection networks

✍ Scribed by Javier Navaridas; Jose Miguel-Alonso; Francisco Javier Ridruejo; Wolfgang Denzel


Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
676 KB
Volume
36
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A tree-like complex network model
✍ Yuying Gu; Jitao Sun πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 597 KB
Computation in a reduced KII network bas
✍ Dongming Xu; JosΓ© C. Principe πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 918 KB

When implementing dynamical systems for information processing, a well-defined set of computational primitives should be constructed to represent the state space. Based on the specific collective behavior of Freeman's computational model of the olfactory cortex, we study the computation of reduced K

Efficiency of optimized bifurcating tree
✍ W. Escher; B. Michel; D. Poulikakos πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 317 KB

A bifurcating tree-like network consists of a single inlet channel, which bifurcates over several levels to uniformly distributed microchannels that are vertically connected to a second network for fluid return. Here we introduce a one-dimensional model that considers convective heat transfer from

Exact boundary observability of unsteady
✍ Qilong Gu; Tatsien Li πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 188 KB πŸ‘ 1 views

## Abstract In this paper we establish the exact boundary observability of unsteady flows in a tree‐like network of open canals with general topology. Copyright Β© 2008 John Wiley & Sons, Ltd.