To read this content please select one of the options below:

FORMULATING DATA DISTRIBUTION AND SEARCH PROBLEMS AS ENTROPY MAXIMIZATION PROBLEMS

K.T. FUNG (School of Computer Science, University of Windsor, Windsor, Ontario, (Canada) N9B 3P4 The author is now with Bell Laboratories, Lincroft, N.J. 07738, U.S.A.)

Kybernetes

ISSN: 0368-492X

Article publication date: 1 January 1983

32

Abstract

The relationship between the search problem and entropy identified by Pierce is used to show that the entropy maximization technique can also be applied to the data distribution problem. An immediate result is that a previously validated entropy model for the data distribution problem can now be more formally developed.

Citation

FUNG, K.T. (1983), "FORMULATING DATA DISTRIBUTION AND SEARCH PROBLEMS AS ENTROPY MAXIMIZATION PROBLEMS", Kybernetes, Vol. 12 No. 1, pp. 39-42. https://doi.org/10.1108/eb005638

Publisher

:

MCB UP Ltd

Copyright © 1983, MCB UP Limited

Related articles