more sections to jump to
This commit is contained in:
parent
52eeae0f5b
commit
113d2ac145
1 changed files with 44 additions and 19 deletions
|
|
@ -35,12 +35,37 @@
|
|||
<li>see also <a href="http://paradiseo.gforge.inria.fr/">ParadisEO</a></li>
|
||||
</ul>
|
||||
|
||||
<p>Jump to section:</p>
|
||||
<ul>
|
||||
<li><a href="#Features">Features</a></li>
|
||||
<li><a href="#Code">Code</a></li>
|
||||
<li><a href="#Development">Development</a></li>
|
||||
</ul>
|
||||
<ol>
|
||||
<lh>Jump to section:</lh>
|
||||
<li>
|
||||
<ol>
|
||||
<lh><a href="#Features">Features</a></lh>
|
||||
<li><a href="#Component-based">Component-based</a></li>
|
||||
<li><a href="#Main-Features">Main Features</a></li>
|
||||
<li><a href="#Portability">Portability</a></li>
|
||||
<li><a href="#Presentations">Presentations</a></li>
|
||||
</ol>
|
||||
</li>
|
||||
<li>
|
||||
<ol>
|
||||
<lh><a href="#Code">Code</a></lh>
|
||||
<li><a href="#Download">Download</a></li>
|
||||
<li><a href="#Facts">Facts</a></li>
|
||||
<li><a href="#License">License</a></li>
|
||||
<li><a href="#Documentation">Documentation</a></li>
|
||||
</ol>
|
||||
</li>
|
||||
<li>
|
||||
<ol>
|
||||
<a href="#Development">Development</a></li>
|
||||
<li><a href="#Mailing-lists">Mailing-lists</a></li>
|
||||
<li><a href="#Get-involved">Get involved</a></li>
|
||||
<li><a href="#Related-software">Related software</a></li>
|
||||
<li><a href="#Authors">Authors</a></li>
|
||||
<li><a href="#Links">Links</a></li>
|
||||
</ol>
|
||||
</li>
|
||||
</ol>
|
||||
</div><!-- class=shortcuts -->
|
||||
|
||||
<ul class="badges">
|
||||
|
|
@ -123,7 +148,7 @@
|
|||
|
||||
<h1><a name="Features"></a>Features <a href="#Plan">⤒</a></h1>
|
||||
|
||||
<h2>Component-based framework</h2>
|
||||
<h2><a name="Component-based"></a>Component-based framework</h2>
|
||||
|
||||
<p>Designing an algorithm with EO consists in choosing what components you want to use for your specific needs, just as building a structure with Lego blocks.</p>
|
||||
<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 components to form an algorithm and connect it to your <em>fitness function</em> (which computes the quality of a given solution).</p>
|
||||
|
|
@ -131,7 +156,7 @@
|
|||
<p><img src="Evolutionary_algorithm.png" title="A typical Evolutionary Algorithm, as seen from the EO point of vue − Johann Dréo − CC-BY-SA" /></p>
|
||||
|
||||
|
||||
<h2>Main Features</h2>
|
||||
<h2><a name="Main-Features"></a>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 -->
|
||||
|
||||
|
|
@ -210,7 +235,7 @@
|
|||
<li><em>And more!</em></li>
|
||||
</ul>
|
||||
|
||||
<h2>Portability</h2>
|
||||
<h2><a name="Portability"></a>Portability</h2>
|
||||
<p> EO should work on Windows and any Un*x-like operating system with a
|
||||
standard-conforming C++ development system. </p>
|
||||
|
||||
|
|
@ -240,7 +265,7 @@
|
|||
with gcc-2.9x and several systems (IRIX, Solaris) with egcs. </p>
|
||||
|
||||
|
||||
<h2>Presentations</h2>
|
||||
<h2><a name="Presentations"></a>Presentations</h2>
|
||||
|
||||
<p> A functional and "philosophical" overview of EO was presented at <a
|
||||
href="http://www.cmap.polytechnique.fr/%7Eea01/">EA'01 conference</a>.
|
||||
|
|
@ -304,7 +329,7 @@
|
|||
|
||||
<h1><a name="Code"></a>Code <a href="#Plan">⤒</a></h1>
|
||||
|
||||
<h2>Download</h2>
|
||||
<h2><a name="Download"></a>Download</h2>
|
||||
|
||||
<p> The current stable release is <a
|
||||
href="http://sourceforge.net/project/showfiles.php?group_id=9775">EO 1.0</a>.
|
||||
|
|
@ -321,7 +346,7 @@
|
|||
href="http://sourceforge.net/project/showfiles.php?group_id=9775">download
|
||||
area</a>. </p>
|
||||
|
||||
<h2>Facts</h2>
|
||||
<h2><a name="Facts"></a>Facts</h2>
|
||||
|
||||
<p>Those statistics are automatically generated by <a href="https://www.ohloh.net/p/eodev">ohloh.net</a>, directly from the EO source code.</p>
|
||||
|
||||
|
|
@ -338,7 +363,7 @@
|
|||
|
||||
|
||||
|
||||
<h2>License</h2>
|
||||
<h2><a name="License"></a>License</h2>
|
||||
|
||||
<p>EO is distributed under the
|
||||
<a href="http://www.gnu.org/copyleft/lesser.html">
|
||||
|
|
@ -347,7 +372,7 @@
|
|||
<p>Note that this license places copyleft restrictions on a program created with EO, but does not apply these restrictions to other software that would links with the program.</p>
|
||||
|
||||
|
||||
<h2>Documentation</h2>
|
||||
<h2><a name="Documentation"></a>Documentation</h2>
|
||||
|
||||
<p>The tutorial demonstrates that writing an evolutionary algorithm
|
||||
evolving your own structures is now <em>easy</em>, using ready-to-use
|
||||
|
|
@ -380,7 +405,7 @@
|
|||
|
||||
<h1><a name="Development"></a>Development <a href="#Plan">⤒</a></h1>
|
||||
|
||||
<h2>Mailing-lists</h2>
|
||||
<h2><a name="Mailing-lists"></a>Mailing-lists</h2>
|
||||
|
||||
<p>EO is an open development effort; that is why we have
|
||||
created mailing lists to discuss future developments, solve technical
|
||||
|
|
@ -389,7 +414,7 @@
|
|||
href="http://sourceforge.net/mail/?group_id=9775">EO mailing lists</a>.</p>
|
||||
|
||||
|
||||
<h2>Get involved</h2>
|
||||
<h2><a name="Get-involved"></a>Get involved</h2>
|
||||
|
||||
<p>The following resources are available, thanks to sourceforge</p>
|
||||
<ul>
|
||||
|
|
@ -409,7 +434,7 @@
|
|||
<li> <a href="https://sourceforge.net/scm/?type=git&group_id=9775">Code repository</a></li>
|
||||
</ul>
|
||||
|
||||
<h2>Related software</h2>
|
||||
<h2><a name="Related-software"></a>Related software</h2>
|
||||
|
||||
<p> <a href="http://paradiseo.gforge.inria.fr"
|
||||
>ParadisEO</a> provides EO extensions for
|
||||
|
|
@ -422,7 +447,7 @@
|
|||
</p>
|
||||
|
||||
|
||||
<h2>Authors</h2>
|
||||
<h2><a name="Authors"></a>Authors</h2>
|
||||
|
||||
<p> EO was started by the <a href="http://geneura.ugr.es/">Geneura
|
||||
Team</a> at the University of Granada, headed by <a
|
||||
|
|
@ -444,7 +469,7 @@
|
|||
infrastructure maintenance. </p>
|
||||
|
||||
|
||||
<h2>Links</h2>
|
||||
<h2><a name="Links"></a>Links</h2>
|
||||
|
||||
<ul>
|
||||
<li><a href="http://www.aip.de/~ast/EvolCompFAQ" >The Hitch-Hiker's Guide to Evolutionary Computation</a>, FAQ for <a href="news:comp.ai.genetic">comp.ai.genetic</a>.</li>
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue