diff --git a/eo/src/moo/eoNSGA_II_Replacement.h b/eo/src/moo/eoNSGA_II_Replacement.h
index 1cafbb81..15a20320 100644
--- a/eo/src/moo/eoNSGA_II_Replacement.h
+++ b/eo/src/moo/eoNSGA_II_Replacement.h
@@ -10,9 +10,6 @@
   Non-Dominant Sorting Genetic Algorithm for MultiObjective
   Optimization: NSGA-II KanGAL Report No. 200001
 
-  Note that this class does not do the sorting per se, but the sorting
-  of it worth_std::vector will give the right order
-
 */
 template <class EOT>
 class eoNSGA_II_Replacement : public eoReplacement<EOT>
diff --git a/eo/src/moo/eoNSGA_IIa_Replacement.h b/eo/src/moo/eoNSGA_IIa_Replacement.h
index b1edb425..b783a009 100644
--- a/eo/src/moo/eoNSGA_IIa_Replacement.h
+++ b/eo/src/moo/eoNSGA_IIa_Replacement.h
@@ -5,13 +5,8 @@
 #include <eoReplacement.h>
 
 /** @brief Fast Elitist Non-Dominant Sorting Genetic Algorithm
-
-  Adapted from Deb, Agrawal, Pratab and Meyarivan: A Fast Elitist
-  Non-Dominant Sorting Genetic Algorithm for MultiObjective
-  Optimization: NSGA-II KanGAL Report No. 200001
-
-  Note that this class does not do the sorting per se, but the sorting
-  of it worth_std::vector will give the right order
+    
+    Variant of the NSGA-II, where the ranking is based on a top-down distance based mechanism ( O(n^2)! )
 
 */
 template <class EOT>