In this paper, we present a review of some recent works on approximation by feedforward neural networks. A particular emphasis is placed on the computational aspects of the problem, i.e. we discuss the possibility of realizing a feedforward neural network which achieves a prescribed degree of accura
Resolvability: A selective survey and some new results
β Scribed by W.W. Comfort; Salvador Garcia-Ferreira
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 1008 KB
- Volume
- 74
- Category
- Article
- ISSN
- 0166-8641
No coin nor oath required. For personal study only.
β¦ Synopsis
Following guidance from the Organizing Committee, the authors give a brief introduction to the theory of spaces which are resolvable in the sense introduced by Hewitt (1943).
The new results presented here are these. (A) A countably compact regular Hausdorff space without isolated points is w-resolvable--that is, it admits an infinite family of pairwise disjoint dense subsets. (B) Among Tychonoff topologies without isolated points on a fixed set, no pseudocompact topology is maximal.
π SIMILAR VOLUMES
## Abstract The purpose of this article is to introduce several results concerning the analysis and synthesis of reliable or invulnerable networks. First, the notion of signed reliability domination of systems is described and some applications to reliability analysis are reviewed. Then the analysi