diff --git a/website/index.html b/index.html similarity index 98% rename from website/index.html rename to index.html index 0ac361d25..e65ec8ba2 100644 --- a/website/index.html +++ b/index.html @@ -10,9 +10,9 @@ - + - + ParadisEO: Fast & full featured optimization heuristics framework @@ -22,8 +22,8 @@
ParadisEO logo

Fast & full featured optimization heuristics framework

@@ -145,7 +145,7 @@

Download the quick start project template, edit the

CMakeLists.txt
file to indicate where to find and start developing your own solver.

To show you how does a code look, you will find below a minimal implementation of the popular CMA-ES algorithm.

- +

The code is presented without comments, to keep it short, but it is yet full-featured, as you will see if you compile it and run

./cmaes --help

Get help

@@ -236,8 +236,8 @@

If you have a classical problem for which available code exists (for example if you have a black-box problem with real-valued variables), you will just choose operators to form an algorithm and connect it to your evaluation function (which computes the quality of a given solution).

- @@ -256,8 +256,8 @@

Of course, it's also possible to add new algorithms "grammar". For instance, the grammar for estimation of distribution algorithms is an extension of the one for evolutionary algorithms. That way, you can re-use the operators already implemented for other algorithms.

- @@ -272,8 +272,8 @@

is organized in several modules, either providing different "grammars" for different algorithms, either providing high-level features. All modules follows the same architecture design and are interoperable with the others, so that you can easily choose the subset of features you need.

- @@ -395,7 +395,7 @@

The following tables show how compares to other active open-source frameworks, to the best of our knowledge (updated on 2019-10-18).

+ src="website/frameworks_comparison.html">

Gathering and maintaining those information is not easy, so take them with a grain of salt, and if you see errors in those tables, please contact us.