nojhan/eodev
Archived
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

example diagrams now close to features list, with a better legend

Browse source
This commit is contained in:
nojhan 2010-08-01 10:55:38 +02:00
commit 82e7d3c041
3 changed files with 19 additions and 7 deletions
Download patch file Download diff file Expand all files Collapse all files

BIN
website/BatchGantt1.png
View file

Binary file not shown.
Side by side Swipe Overlay

Before

Width:  |  Height:  |  Size: 20 KiB

After

Width:  |  Height:  |  Size: 21 KiB

Before After
Before After

22
website/index.html
View file

@ -118,12 +118,6 @@
They are also ranked among <em>computational intelligence</em> methods, a domain close to artificial intelligence. They are also ranked among <em>computational intelligence</em> methods, a domain close to artificial intelligence.
</p> </p>
<p>
<img src="Gallagher_Gaussian_BBOB_f21.png" title="Gallagher's Gaussian 101-me Peaks function, Black Box Optimization Benchmark f21 − COCO team" /> <!-- http://coco.lri.fr/BBOB-downloads/download10.2/bbobdocfunctions.pdf -->
<img src="200px-Graph_betweenness.svg.png" title="Hue scale representing node betweenness on a graph − Claudio Rocchini − CC-BY" /><!-- http://commons.wikimedia.org/wiki/File:Graph_betweenness.svg -->
<img src="BatchGantt1.png" title="Gantt Chart for a Batch Process − Casilett − DP" /><!-- http://en.wikipedia.org/wiki/File:BatchGantt1.png -->
</p>
<p>With the help of EO, you can easily design evolutionary algorithms that will find solutions to virtually all kind of hard optimization problems, from continuous to combinatorial ones.</p> <p>With the help of EO, you can easily design evolutionary algorithms that will find solutions to virtually all kind of hard optimization problems, from continuous to combinatorial ones.</p>
@ -139,7 +133,21 @@
<h2>Main Features</h2> <h2>Main Features</h2>
<img src="http://upload.wikimedia.org/wikipedia/en/timeline/3f507249a36a4a38020e7fc0a5f448df.png" title="Metaheuristics that can be implemented with EO and ParadisEO, ordered by date of invention − Johann Dréo/Wikipédia − CC-BY-SA" style="float:right;" /> <!-- http://en.wikipedia.org/wiki/Metaheuristic --> <!-- <img src="http://upload.wikimedia.org/wikipedia/en/timeline/3f507249a36a4a38020e7fc0a5f448df.png" title="Metaheuristics that can be implemented with EO and ParadisEO, ordered by date of invention − Johann Dréo/Wikipédia − CC-BY-SA" style="float:right;" /> --> <!-- http://en.wikipedia.org/wiki/Metaheuristic -->
<table style="float:right;" class="examples">
<caption>Examples of problems that you can solve with the help of EO:</caption>
<tr><td>
<img src="Gallagher_Gaussian_BBOB_f21.png" title="Continuous problems (here Gallagher's Gaussian 101-me Peaks function, Black Box Optimization Benchmark, f21 − COCO team)" /> <!-- http://coco.lri.fr/BBOB-downloads/download10.2/bbobdocfunctions.pdf -->
</tr></td>
<tr><td>
<img src="200px-Graph_betweenness.svg.png" title="Graph problems (here a Hue scale representing node betweenness on a graph − Claudio Rocchini − CC-BY)" /><!-- http://commons.wikimedia.org/wiki/File:Graph_betweenness.svg -->
</tr></td>
<tr><td>
<img src="BatchGantt1.png" title="Planning problems (here a Gantt Chart for a Batch Process − Casilett − DP)" /><!-- http://en.wikipedia.org/wiki/File:BatchGantt1.png -->
</tr></td>
</table>
<ul> <ul>
<li>Flexible design that permits to easily create virtually any algorithm</li> <li>Flexible design that permits to easily create virtually any algorithm</li>

4
website/lightblue.css
View file

@ -71,6 +71,10 @@ blockquote {
padding-left:1em; padding-left:1em;
} }
table.examples {
margin-right:0.5em;
}
h1, h2, h3, h4, h5, h6, p, pre, blockquote, label, ul, ol, dl, h1, h2, h3, h4, h5, h6, p, pre, blockquote, label, ul, ol, dl,
fieldset, address { margin:0.75em 0;} fieldset, address { margin:0.75em 0;}