Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Zhao, Qiangfu
Affiliations: The University of Aizu, Aizu-Wakamatsu, Japan 965–80. Tel.: +81 242 37 2519; Fax: +81 242 37 2743; E-mail: [email protected]
Abstract: Compared with the conventional approaches, the evolutionary algorithms (EAs) are more efficient for system design in the sense that EAs can provide higher opportunity for obtaining the global optimal solution. However, in most existing EAs, an individual corresponds directly to a possible solution, and a large amount of computations is required for designing large-scaled systems. To solve this problem, this paper proposes a co-evolutionary algorithm (CEA). The basic idea is to divide and conquer: divide the system into many small homogeneous modules, define an individual as a module, find many good individuals using existing EAs, and put them together again to form the whole system. To make the study more concrete, we focus the discussion on the evolutionary learning of neural networks for pattern recognition. Experimental results are provided to show the procedure and the performance of the CEA.
Journal: Journal of Intelligent and Fuzzy Systems, vol. 6, no. 1, pp. 83-90, 1998
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]