A sequential sampling procedure for genetic algorithms
β Scribed by A.N. Aizawa; B.W. Wah
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 458 KB
- Volume
- 27
- Category
- Article
- ISSN
- 0898-1221
No coin nor oath required. For personal study only.
β¦ Synopsis
In this paper, we apply sequential decision theory for scheduling tests in genetic algorithms and investigate an efficient sampling procedure for improving its performance. We use a loss function specifically defined for our analysis and obtain sequential decision equations for the optimal procedure. We derive simplified equations so that the procedure can be applied in practice. Finally, we compare the performance of our heuristic sampling procedure with that of the original genetic algorithms.
π SIMILAR VOLUMES
Academic Press, San Diego). One major problem is on how to estimate or recover the parameter values for a given procedural texture using the input texture image if the original parameter values are not available. In this paper, we propose a solution to this problem and present a genetic-based multir
## Abstract We have investigated protein conformation sampling and optimization based on the genetic algorithm and discrete main chain dihedral state model. An efficient approach combining the genetic algorithm with local minimization and with a niche technique based on the sharing function is prop
A five-stage sequential leaching procedure, developed in this work, was successfully applied to fly ash samples collected at several emission sources. The solvent leaching experiments, together with solid phase examinations carried out by X-ray powder diffraction, provide information on the possible