From 20d37259e9ec3a4f605084bacb653db4db754880 Mon Sep 17 00:00:00 2001 From: evomarc Date: Sun, 3 Dec 2006 07:21:44 +0000 Subject: [PATCH] Added a note to avoid that some dishonest researchers use teh code in this tutorial as a basis for comparing their algorithms with "EAs" as was done for the LEM3 algorithm in GECCO 2006. --- eo/tutorial/html/eoTutorial.html | 19 +++++++++++++++++++ 1 file changed, 19 insertions(+) diff --git a/eo/tutorial/html/eoTutorial.html b/eo/tutorial/html/eoTutorial.html index 2986ce10..d3aeb7a3 100644 --- a/eo/tutorial/html/eoTutorial.html +++ b/eo/tutorial/html/eoTutorial.html @@ -17,6 +17,25 @@ and to

EO Tutorial

+
Important notice - December 2006 +

+The code that is proposed in this tutorial should not +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 not +use ESEA in Lesson4, +but go to the test directory, type +make t-eoCMAES and use the resulting t-eoCMAES. But as of today, +the latest algorithms (and comparative results) +are better found on Nikolaus Hansen Web page +and on his "Comparison of Evolutionary Algorithms on a Benchmark Function Set" page).
+
+
+
Version 0.98a - December 2004