✦ LIBER ✦

Simple sample bound for feedforward sigmoid networks with bounded weights

✍ Scribed by Nageswara S.V. Rao

Book ID: 114297203
Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 120 KB
Volume: 29
Category: Article
ISSN: 0925-2312
DOI: 10.1016/s0925-2312(99)00113-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Function Estimation by Feedforward Sigmo

Function Estimation by Feedforward Sigmoidal Networks with Bounded Weights

✍ Nageswara S.V. Rao; Vladimir Protopopescu 📂 Article 📅 1998 🏛 Springer US 🌐 English ⚖ 89 KB

Modules with bounded weight multipliciti

Modules with bounded weight multiplicities for simple Lie algebras

✍ Georgia Benkart; Daniel Britten; Frank Lemire 📂 Article 📅 1997 🏛 Springer-Verlag 🌐 French ⚖ 267 KB

Simple Product-Form Bounds for Queueing

Simple Product-Form Bounds for Queueing Networks with Finite Clusters

✍ Nico M. van Dijk; Erik van der Sluis 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 143 KB

Simple Algorithms for Routing on Butterf

Simple Algorithms for Routing on Butterfly Networks with Bounded Queues

✍ Maggs, Bruce M.; Sitaraman, Ramesh K. 📂 Article 📅 1998 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 378 KB

A simple throughput bound for large clos

A simple throughput bound for large closed queueing networks with finite capacities

✍ Nico M. van Dijk 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 924 KB

Throughput bounding and simple approxima

Throughput bounding and simple approximation methods for exponential fork/join queueing networks with blocking

✍ Chun-Hyun Paik 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 236 KB

Exponential fork/join queueing networks (FJQNs) with finite buffers have been used as a major tool for evaluating the performances of manufacturing systems. In this study, we fast suggest the throughput upper and lower bounds. Our upper-bounding method is elaborated on with general network configura