MastersWork.DPEncoding History
Hide minor edits - Show changes to output
Changed line 2 from:
DPE, proposed by [[RefSchraudolphBelew1992 Scraudolph and Belew]] changes the individual representation scheme dynamically via searching for the "target interval". It uses a GA with multiple restarts. The first run is used to find an interim solution, and the subsequent runs decode the genes as distances (delta values) from the last interim solution.
to:
DPE, proposed by [[RefSchraudolphBelew1992 Schraudolph and Belew]] changes the individual representation scheme dynamically via searching for the "target interval". It uses a GA with multiple restarts. The first run is used to find an interim solution, and the subsequent runs decode the genes as distances (delta values) from the last interim solution.
Changed line 2 from:
DPE changes the individual representation scheme dynamically via searching for the "target interval". It uses a GA with multiple restarts. The first run is used to find an interim solution, and the subsequent runs decode the genes as distances (delta values) from the last interim solution.
to:
DPE, proposed by [[RefSchraudolphBelew1992 Scraudolph and Belew]] changes the individual representation scheme dynamically via searching for the "target interval". It uses a GA with multiple restarts. The first run is used to find an interim solution, and the subsequent runs decode the genes as distances (delta values) from the last interim solution.
Changed lines 5-8 from:
In this, as a GA gets near to what seems to be an optimum, then the genome is recoded, and the search space is "zoomed in on".
to:
In this, as a GA gets near to what seems to be an optimum, then the genome is recoded, and the search space is "zoomed in on".
-----
<|ThingsLookedUp|>
-----
<|ThingsLookedUp|>
Changed lines 1-5 from:
to:
!Dynamic Parameter Encoding (DPE)
DPE changes the individual representation scheme dynamically via searching for the "target interval". It uses a GA with multiple restarts. The first run is used to find an interim solution, and the subsequent runs decode the genes as distances (delta values) from the last interim solution.
''(from RefLeung2002)''
In this, as a GA gets near to what seems to be an optimum, then the genome is recoded, and the search space is "zoomed in on".
DPE changes the individual representation scheme dynamically via searching for the "target interval". It uses a GA with multiple restarts. The first run is used to find an interim solution, and the subsequent runs decode the genes as distances (delta values) from the last interim solution.
''(from RefLeung2002)''
In this, as a GA gets near to what seems to be an optimum, then the genome is recoded, and the search space is "zoomed in on".
Page last modified on January 12, 2005, at 02:50 AM