move index.html at the root

enable github's webpages
This commit is contained in:
Johann Dreo 2020-05-07 11:53:37 +02:00
commit 87408d1b80

View file

@ -10,9 +10,9 @@
<meta name="resource-type" content="document" />
<meta name="distribution" content="Global" />
<link rel="icon" type="image/png" href="eo_ico.png" />
<link rel="icon" type="image/png" href="website/eo_ico.png" />
<link href="https://fonts.googleapis.com/css2?family=Comfortaa:wght@400;500;700&display=swap" rel="stylesheet">
<link rel="stylesheet" type="text/css" href="lightblue.css" title="Default" />
<link rel="stylesheet" type="text/css" href="website/lightblue.css" title="Default" />
<title>ParadisEO: Fast & full featured optimization heuristics framework</title>
@ -22,8 +22,8 @@
<div id="alt">
<img style="clear:left;"
src="paradiseo_logo_200px.png"
srcset="paradiseo_logo.svg"
src="website/paradiseo_logo_200px.png"
srcset="website/paradiseo_logo.svg"
width="100%"
alt="ParadisEO logo" />
<p id="slogan">Fast &amp; full featured optimization heuristics framework</p>
@ -145,7 +145,7 @@
<p>Download the <a href="https://gforge.inria.fr/frs/download.php/31755/QuickStart.zip">quick start project template</a>, edit the <pre>CMakeLists.txt</pre> file to indicate where to find <em class="logo">Paradis<span class="logo_eo">eo</span></em> and start developing your own solver.</p>
<p>To show you how does a <em class="logo">Paradis<span class="logo_eo">eo</span></em> code look, you will find below a minimal implementation of the popular CMA-ES algorithm.</p>
<iframe class="code" src="t-minimal-cmaes.cpp.html"></iframe>
<iframe class="code" src="website/t-minimal-cmaes.cpp.html"></iframe>
<p>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 <pre class="command">./cmaes --help</pre></p>
<h2><a name="Gethelp"></a>Get help</h2>
@ -236,8 +236,8 @@
<p>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 <em>evaluation function</em> (which computes the quality of a given solution).</p>
<figure>
<img src="Evolutionary_algorithm.png"
srcset="Evolutionary_algorithm.svg"
<img src="website/Evolutionary_algorithm.png"
srcset="website/Evolutionary_algorithm.svg"
width="100%"
style="max-width:512px;"
title="Grammar for Evolutionary Algorithms, as seen from the ParadisEO point of vue Johann Dréo CC-BY-SA" />
@ -256,8 +256,8 @@
<p>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.</p>
<figure>
<img src="edo_design.png"
srcset="edo_design.svg"
<img src="website/edo_design.png"
srcset="website/edo_design.svg"
width="100%"
style="max-width:512px;"
title="Grammar for Estimation of Distribution Algorithms, as seen from the ParadisEO point of vue Johann Dréo CC-BY-SA" />
@ -272,8 +272,8 @@
<p><em class="logo">Paradis<span class="logo_eo">eo</span></em> 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.</p>
<figure>
<img src="paradiseo_modules.png"
srcset="paradiseo_modules.svg"
<img src="website/paradiseo_modules.png"
srcset="website/paradiseo_modules.svg"
width="100%"
style="max-width:512px;"
title="ParadisEO is organized in several modules Johann Dréo CC-BY-SA" />
@ -395,7 +395,7 @@
<p>The following tables show how <em class="logo">Paradis<span class="logo_eo">eo</span></em> compares to other active open-source frameworks, to the best of our knowledge (updated on 2019-10-18).</p>
<iframe class="table"
style="height:50ch;"
src="frameworks_comparison.html"></iframe>
src="website/frameworks_comparison.html"></iframe>
<p>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.</p>