By Topic

Constrained clustering and parallel genetic algorithm on a multiprocessor system FIN

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
$31 $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

4 Author(s)
Myung-Mook Jian ; Dept. of Inf. & Comput. Sci., Osaka City Univ., Japan ; Tatsumi, S. ; Kitamura, Y. ; Okumoto, T.

Genetic algorithms (GA) are typically regarded as the unconstrained search procedure within the given representation space. But many actual problems hold one or more constraints that must be satisfied. In this paper, we consider the incorporation of constraints into fitness function and solve the constrained clustering problem using the GA through a multiprocessor system (FIN) which has a self-similarity network

Published in:

Systems, Man, and Cybernetics, 1994. Humans, Information and Technology., 1994 IEEE International Conference on  (Volume:2 )

Date of Conference:

2-5 Oct 1994