ParadisEO: Fast & full featured optimization heuristics framework
@@ -289,7 +288,7 @@
To give an order of magnitude:
-
If you use the "official" vanilla implementation of CMA-ES in Python/Numpy solving the BBOB problem suite through the COCO plateform, running the whole benchmark will take approximately 10 minutes on a single Intel Core i5 @ 2.50GHz with an solid state disk.
+
If you use the "official" vanilla implementation of CMA-ES in Python/Numpy solving the BBOB problem suite through the COCO plateform, running the whole benchmark will take approximately 10 minutes on a single Intel Core i5 @ 2.50GHz with a colid state disk.
The same experiment, running the Paradiseo implementation using the seamless binding to the IOHprofiler BBOB implementation, will take 1 minute.
Thus, you can expect that an algorithm implemented with Paradiseo will be up to 10 times faster than its (heavily optimized) Python counterpart.
@@ -737,7 +736,7 @@
The core EO module is described in the following scientific article: