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

index de la doc modifié

Browse source 
git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@1873 331e1502-861f-0410-8da2-ba01fb791d7f
This commit is contained in:
jhumeau 2010-06-28 14:57:24 +00:00
commit bc80ddded3
2 changed files with 12 additions and 5 deletions
Download patch file Download diff file Expand all files Collapse all files

10
trunk/paradiseo-mo/doc/index.h
View file

@ -2,8 +2,16 @@
@section Introduction @section Introduction
ParadisEO-MO is a white-box object-oriented generic framework dedicated to the flexible design of local search algorithms. ParadisEO-MO is a white-box object-oriented generic framework dedicated to the flexible design of local search algorithms (hill-climbing, tabu search, simulated annealing, ...)
@section tutorials Tutorials
Tutorials for ParadisEO-MO are available in the "Tutorials section" of the <a href="http://paradiseo.gforge.inria.fr">ParadisEO website</a>.
@section Design
For an introduction to the design of ParadisEO-MO,
you can look at the <a href="http://paradiseo.gforge.inria.fr">ParadisEO website</a>.
@section LICENSE @section LICENSE

7
trunk/paradiseo-moeo/doc/index.h
View file

@ -8,7 +8,7 @@ aims to provide a set of classes allowing to ease and speed up the development o
It is based on a clear conceptual distinction between the solution methods and the multi-objective problems they are intended to solve. It is based on a clear conceptual distinction between the solution methods and the multi-objective problems they are intended to solve.
This separation confers a maximum design and code reuse. This separation confers a maximum design and code reuse.
ParadisEO-MOEO provides a broad range of archive-related features (such as elitism or performance metrics) ParadisEO-MOEO provides a broad range of archive-related features (such as elitism or performance metrics)
and the most common Pareto-based fitness assignment strategies (MOGA, NSGA, SPEA, IBEA and more). and the most common Pareto-based fitness assignment strategies (MOGA, NSGA, SPEA, IBEA and more). Dominance-based Local Search are also available.
Furthermore, parallel and distributed models as well as hybridization mechanisms can be applied to an algorithm designed within ParadisEO-MOEO Furthermore, parallel and distributed models as well as hybridization mechanisms can be applied to an algorithm designed within ParadisEO-MOEO
using the whole version of ParadisEO. using the whole version of ParadisEO.
@ -16,14 +16,13 @@ using the whole version of ParadisEO.
@section tutorials Tutorials @section tutorials Tutorials
Tutorials for ParadisEO-MOEO are available <a href="http://paradiseo.gforge.inria.fr/index.php?n=Paradiseo.UsersGuides">here</a>. Tutorials for ParadisEO-MOEO are available in the "Tutorials section" of the <a href="http://paradiseo.gforge.inria.fr">ParadisEO website</a>.
@section Installation @section Installation
The installation procedure of the package is detailed in the <a The installation procedure of the package is detailed in the README file in the top-directory of the source-tree.
href="../../README">README</a> file in the top-directory of the source-tree.