CYBERNETIC ALGORITHM DESIGN FOR FINITE DOMAINS
BUSH JONES
(Computer Science Department, Louisiana State University, Baton Rouge, LA 70803 (U.S.A.))
LESLIE JONES
(Computer Science Department, Louisiana State University, Baton Rouge, LA 70803 (U.S.A.))
28
Abstract
A general model descriptive of many algorithms on finite domains is developed. Properties of the model are investigated. Systematic principles are presented for constructing an algorithm specific to a problem. The theory is demonstrated by examples from sorting and searching. Indeed, efficient algorithms can be easily and automatically generated for virtually any sorting or searching problem. However, the theory is general, and applications go far beyond the example areas given.
Citation
JONES, B. and JONES, L. (1982), "CYBERNETIC ALGORITHM DESIGN FOR FINITE DOMAINS", Kybernetes, Vol. 11 No. 4, pp. 255-260. https://doi.org/10.1108/eb005626
Publisher
:MCB UP Ltd
Copyright © 1982, MCB UP Limited