nojhan/eodev
Archived
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

Added a note to avoid that some dishonest researchers use teh code

Browse source 
in this tutorial as a basis for comparing their algorithms with "EAs"
as was done for the LEM3 algorithm in GECCO 2006.
This commit is contained in:
evomarc 2006-12-03 07:21:44 +00:00
commit 20d37259e9
1 changed files with 19 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

19
eo/tutorial/html/eoTutorial.html
View file

@ -17,6 +17,25 @@ and to</font></b></center>
<h1>
<font color="#FF0000">EO Tutorial</font></h1></center>
<center><font color="#FF0000">Important notice - December 2006</font>
</center><br>
The code that is proposed in this tutorial should <font color="#FF0000"><b>not</b></font>
be used
as a basis for any comparison with any original method on any benchmark problem.
It is an illustration of what you can achieve with EO, but reaching state-of-the-art results
requires more work. In particular, if you want to compare your evolutionary
algorithm with a good performing algorithm in parameteric optimisation,
do <font color="#FF0000"><b>not</b></font>
use <font color="#FF6666"><b>ESEA</b></font> in Lesson4,
but go to the <font color="#FF6666"><b>test</b></font> directory, type
<font color="#FF6600"><b>make t-eoCMAES</b></font> and use the resulting <font
color="#FF6666"><b>t-eoCMAES</b></font>. But as of today,
the latest algorithms (and comparative results)
are better found on <a href="http://www.bionik.tu-berlin.de/user/niko/">Nikolaus Hansen Web page</a>
and on his <a href="http://www.bionik.tu-berlin.de/user/niko/cec2005.html">"Comparison of Evolutionary Algorithms on a Benchmark Function Set" page</a>).<br>
<br>
<br>
<center><font color="#FF0000">Version 0.98a - December 2004</font>
</center>