From bc80ddded3b9abae887d43dc9d2e5475e1663d26 Mon Sep 17 00:00:00 2001 From: jhumeau Date: Mon, 28 Jun 2010 14:57:24 +0000 Subject: [PATCH] =?UTF-8?q?index=20de=20la=20doc=20modifi=C3=A9?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@1873 331e1502-861f-0410-8da2-ba01fb791d7f --- trunk/paradiseo-mo/doc/index.h | 10 +++++++++- trunk/paradiseo-moeo/doc/index.h | 7 +++---- 2 files changed, 12 insertions(+), 5 deletions(-) diff --git a/trunk/paradiseo-mo/doc/index.h b/trunk/paradiseo-mo/doc/index.h index b59421284..da6778372 100644 --- a/trunk/paradiseo-mo/doc/index.h +++ b/trunk/paradiseo-mo/doc/index.h @@ -2,8 +2,16 @@ @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 ParadisEO website. + +@section Design + +For an introduction to the design of ParadisEO-MO, +you can look at the ParadisEO website. @section LICENSE diff --git a/trunk/paradiseo-moeo/doc/index.h b/trunk/paradiseo-moeo/doc/index.h index 7d66328c1..4aa7971db 100644 --- a/trunk/paradiseo-moeo/doc/index.h +++ b/trunk/paradiseo-moeo/doc/index.h @@ -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. 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) -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 using the whole version of ParadisEO. @@ -16,14 +16,13 @@ using the whole version of ParadisEO. @section tutorials Tutorials -Tutorials for ParadisEO-MOEO are available here. +Tutorials for ParadisEO-MOEO are available in the "Tutorials section" of the ParadisEO website. @section Installation -The installation procedure of the package is detailed in the README file in the top-directory of the source-tree. +The installation procedure of the package is detailed in the README file in the top-directory of the source-tree.