S. Mostaghim, J. Teich, and A. Tyagi, "Comparison of Data Structures for Storing Pareto-sets in MOEAs," in Proceedings of the 2002. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Pareto Evolutionary Neural Networks - Fieldsend, Singh (2003) (Correct)
....maintained. Most recent work in the MOEA domain has been concerned with how the search population of the EC process and F should interact, and how to evolve the search as time progresses. Recent work has also investigated efficient approaches to the storing and maintenance of F as its size grows [14, 17, 41]. Here a framework for general multi objective evolutionary neural network (MOENN) training is outlined in Figure 2, which can be viewed as a synthesis of work from the uni objective ENN literature and the MOEA literature. In this new framework a set of estimated Pareto optimal ENNs is maintained ....
S. Mostaghim, J. Teich, and A. Tyagi. Comparison of Data Structures for Storing Pareto-sets in MOEAs. In Proceedings of the 2002.
Using Unconstrained Elite Archives for Multi-Objective.. - Fieldsend, Everson, Singh (2001) (5 citations) (Correct)
....developed by McCreight [28] are suited to rectangular queries in which the rectangle is unbounded on a single side. Sun and Steuer [29] describe an alternative data structure adapted for answering queries about domination and non domination; which has been extended recently by Mostaghim et al. [30]. The dominates relation imposes a partial order on individuals. However, since the elements of F are mutually non dominating, this relation cannot be used directly to construct, for example, a binary tree to enable fast searching. Instead the dominated tree consists of a list of L = M D] ....
S. Mostaghim, J. Teich, and A. Tyagi. Comparison of Data Structures for Storing Pareto- sets in MOEAs. In Proceedings of the IEEE Conference on Evolutionary Computation, part of the IEEE World Congress on Computational Intelligence, Hawaii, May 12-17, 2002. IEEE Press. 41
Pareto Evolutionary Neural Networks - Jonathan Fieldsend Member (Correct)
No context found.
S. Mostaghim, J. Teich, and A. Tyagi, "Comparison of Data Structures for Storing Pareto-sets in MOEAs," in Proceedings of the 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC