Barbara Schindler, Franz Rothlauf, and Hans-Josef Pesch, "Evolution strategies, network random keys, and the One-Max Tree problem," in Applications of Evolutionary Computing: EvoWorkshops 2002. Home/Search Document Details and Download
Summary Related Articles |
This paper is cited in the following contexts:
Edge-Sets: An Effective Evolutionary Coding of Spanning Trees - Raidl, al. (Correct)
....expensive O(m log m) because it requires sorting the edges. Thus, network random keys are e#ective only for small or sparse problems. Rothlauf et al. 36] reported good results with this coding on instances of the optimum communication spanning tree problem of up to 26 nodes. Schindler et al. [38] further investigated random network keys in an evolution strategy framework. F. Other Representations Other representations of spanning trees are less often used. In degree based permutations [39] a chromosome consists of two strings. The first holds a permutation of the node labels, and the ....
Barbara Schindler, Franz Rothlauf, and Hans-Josef Pesch, "Evolution strategies, network random keys, and the One-Max Tree problem," in Applications of Evolutionary Computing: EvoWorkshops 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