By Topic

Performance comparison of two evolutionary schemes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
P. Dutta ; Electron. & Commun. Sci. Unit, Indian Stat. Inst., Calcutta, India ; D. DuttalMajumder

The performance of a deterministic algorithm is judged by its computational complexity. But an evolutionary algorithm being probabilistic in nature, its convergence has some probability associated with it. In the present paper, we try to locate the parameters that control the performance of an evolutionary algorithm. In this formulation, we make some assumptions, under which the performance comparison is possible. Moreover we propose a notion of characteristic polynomial which gives a measure of the performance of an evolutionary scheme. The area under the curve of the characteristic polynomial over the range 0 to 1 is equivalently shown to represent the performance criterion

Published in:

Pattern Recognition, 1996., Proceedings of the 13th International Conference on  (Volume:4 )

Date of Conference:

25-29 Aug 1996