𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An approximate planning model for distributed computing networks

✍ Scribed by John S. Hollywood

Publisher
John Wiley and Sons
Year
2005
Tongue
English
Weight
191 KB
Volume
52
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An algorithm for planning jointing of li
An algorithm for planning jointing of lines in an optical distribution network
✍ Masayuki Tsujino πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 600 KB

A method of determining the most effective way to joint lines in an optical distribution network is needed, because of the high cost of jointing optical-fiber lines compared to lines in a metallic network and because of the limitation on the number of joints. In this paper, I model the joint form pl

An approximate integral model with an ar
An approximate integral model with an artificial neural network for heat exchangers
✍ Guo-Liang Ding; Chun-Lu Zhang; Tao Zhan πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 388 KB

## Abstract In order to improve predicting precision and increase computation speed of simulation for heat exchangers, a novel method is presented in this paper, whereby an approximate integral model is used to simplify the original distributed parameter model and an artificial neural network is co

Algebraic Modeling of an ad Hoc Network
Algebraic Modeling of an ad Hoc Network for Mobile Computing
✍ Panos A. Patsouris πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 310 KB

We develop an algebraic model of an ad hoc network [9] for mobile computing. The ad hoc network's structure and functionality is based (in our approach) on a pathset algebra. A pathset is the set of all paths in the network having specific source(s) and destination(s). The pathsets' set refers to a