diff --git a/website/frameworks_comparison.ods b/website/frameworks_comparison.ods new file mode 100644 index 000000000..c75eb96a7 Binary files /dev/null and b/website/frameworks_comparison.ods differ diff --git a/website/index.html b/website/index.html index 7cf665fdc..5dd753ca4 100644 --- a/website/index.html +++ b/website/index.html @@ -58,6 +58,7 @@
  • Optimization Problems
  • Metaheuristics
  • Why choosing ?
  • +
  • How Fast is ?
  • @@ -66,6 +67,7 @@
  • Composable design
  • Lot of Components
  • Portability
  • +
  • VS other Frameworks
  • @@ -210,6 +212,23 @@

    +

    How fast is ?

    + +

    To give an order of magnitude: +

    + Thus, you can expect that an algorithm implemented with will be up to 10 times faster than its (heavily optimized) Python counterpart. + As indicated in the previous section, this speed is crucially useful for algorithm design and algorithm selection. +

    + + +
    +

    CMA-ES solves numeric problems with quadratic complexity regarding the number of dimensions. If you target simpler algorithms, they will be faster but one can expect a similar behaviour.

    +

    The pycma used for the comparison rely on numpy for the heavy parts of the computations. If you use a pure Python implementation, the difference will be far greater.

    +
    +

    Features

    @@ -374,6 +393,14 @@ +

    VS other Frameworks

    + +

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

    + +

    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.

    +

    Documentation

    @@ -384,7 +411,7 @@
  • The core EO module is described in the following scientific article:

    M. Keijzer, J.J. Merelo, G. Romero, G., M. Schoenauer, - Paradiseo/-EA01.ps.gz">Evolving + Evolving objects: A general purpose evolutionary computation library, Artificial Evolution, 2310, 829--888 (2002).

    @@ -403,7 +430,7 @@   volume =    "2310",
      pages =     "829--888",
      keywords =  "genetic algorithms, genetic programming, evolutionary computation, metaheuristic, computational intelligence, optimization",
    -   URL =       "Paradiseo/-EA01.ps.gz">http://www.lri.fr/~marc//-EA01.ps.gz",
    +   URL =       "http://www.lri.fr/~marc//-EA01.ps.gz",
      size =      "12 pages",
    diff --git a/website/lightblue.css b/website/lightblue.css index a0cbbf434..aa0f932fc 100644 --- a/website/lightblue.css +++ b/website/lightblue.css @@ -322,15 +322,6 @@ ul#menu a.selected:visited { background: #3366CC; color: #FFFFFF; } text-align:center; } -.figure { - float:right; - text-align:center; - margin:1em; - padding:5px; - border:thin solid #eee; - background-color:white; -} - .legend { font-style:italic; font-size:80%; @@ -394,11 +385,21 @@ figcaption { margin-left:5%; } -.code { +iframe.code { width:95%; height:35em; resize:vertical; overflow-y:scroll; + box-shadow: 5px 10px 18px #ddd; +} + +iframe.table { + padding:1em; + border:thin solid lightgray; + box-shadow: 5px 10px 18px #ddd; + width:60%; + max-width: 30em; + margin-left:20% } @media only screen and (max-width: 800px) { @@ -454,5 +455,14 @@ figcaption { max-width:80%; margin-left:5%; } + + iframe.table { + padding:1em; + border:thin solid lightgray; + box-shadow: 5px 10px 18px #ddd; + width:80%; + max-width: 30em; + margin-left:5% + } }