The attributes of flexibility and efficiency attainable with random search techniques are discussed as well as a scope of application ranging from uses involving high speed general purpose computers to extremely simple adaptive devices. ## 1. Introduction ONLY IN recent years has serious study bee
Optimization for pattern classification using biased random search techniques
โ Scribed by Gabor T. Herman; Dewey Odhner; K. T. Daniel Yeung
- Book ID
- 112669960
- Publisher
- Springer US
- Year
- 1993
- Tongue
- English
- Weight
- 578 KB
- Volume
- 43
- Category
- Article
- ISSN
- 0254-5330
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
The modified random-to-pattern search (MRPS) algorithm, developed by the authors for global optimization, is applied to find the global optimum of system cost of a complex system subject to constraints on system reliability. The global optimum solutions obtained by MRPS are compared with those obtai
This paper concerns the application of adaptive random search techniques to large parameter optimization and identification problems. A brief review of the algorithm is presented, followed by a discussion of 3 examples: (1) identification of 25 unknown parameters in a nonlinear 5-degree of freedom m