[jboss-svn-commits] JBL Code SVN: r26642 - labs/jbossrules/trunk/drools-docs/drools-docs-solver/src/main/docbook/en-US/Chapter-Solver.

[jboss-svn-commits at lists.jboss.org]

Author: ge0ffrey
Date: 2009-05-21 04:21:02 -0400 (Thu, 21 May 2009)
New Revision: 26642

Modified:
   labs/jbossrules/trunk/drools-docs/drools-docs-solver/src/main/docbook/en-US/Chapter-Solver/Section-Local_Search_Solver.xml
Log:
grammar

Modified: labs/jbossrules/trunk/drools-docs/drools-docs-solver/src/main/docbook/en-US/Chapter-Solver/Section-Local_Search_Solver.xml
===================================================================
--- labs/jbossrules/trunk/drools-docs/drools-docs-solver/src/main/docbook/en-US/Chapter-Solver/Section-Local_Search_Solver.xml	2009-05-20 17:12:02 UTC (rev 26641)
+++ labs/jbossrules/trunk/drools-docs/drools-docs-solver/src/main/docbook/en-US/Chapter-Solver/Section-Local_Search_Solver.xml	2009-05-21 08:21:02 UTC (rev 26642)
@@ -29,13 +29,14 @@
       </listitem>
     </itemizedlist>
 
-    <para>An algorithm that checks every possible solution (even with pruning) can easily run for a couple of years on a
+    <para>An algorithm that checks every possible solution (even with pruning) can easily run for billions of years on a
     single real-life planning problem. Most of the time, we are happy with a feasible solution found in a limited amount
     of time. Local search tends to find a feasible solution relatively fast. Because it acts very much like a human, it
     is also pretty natural to program.</para>
 
-    <para>Local search solves a problem making a move on the current solution to change it into a better solution. It
-    does that number of times till it is satisfied with the solution. It starts with the starting solution.</para>
+    <para>Local search solves a problem by making a move on the current solution which changes it into a better
+    solution. It does that number of times till it is satisfied with the solution. It starts with the starting
+    solution.</para>
 
     <para>A local search algorithm and the drools rule engine turn out to be a really nice combination, because:</para>