tweak to BOA

book/a_probabilistic/boa.tex

@@ -118,7 +118,6 @@ \subsection{Heuristics}
 	\item Bayesian networks are typically constructed (grown) from scratch each iteration using an iterative process of adding, removing, and reversing links. Additionally, past networks may be used as the basis for the subsequent generation.
 	\item A greedy hill-climbing algorithm is used each algorithm iteration to optimize a Bayesian network to represent a population of candidate solutions.
 	\item The fitness of constructed Bayesian networks may be assessed using the Bayesian Dirichlet Metric (BD) or a Minimum Description length method called the Bayesian Information Criterion (BIC).
-
 \end{itemize}
 
 % Code Listing