this is for holding javascript data
Joao Paulo Papa edited Introduction.tex
over 8 years ago
Commit id: 27f06208a0c90537972255b734cf7defb79bf090
deletions | additions
diff --git a/Introduction.tex b/Introduction.tex
index 0c3e790..b755414 100644
--- a/Introduction.tex
+++ b/Introduction.tex
...
\end{equation}
where $\varrho_{min}$ and $\varrho_{max}$ stand for the minimum and maximum values of $\varrho$, respectively.
\paragraph{Global-best Harmony Search}
\label{ss.ghs}
The Global-best Harmony Search (GHS)~ employs the same modification proposed by IHS with respect to dynamic PAR values. However, it does not employ the concept of bandwidth, being Equation~\ref{eq:par} replaced by:
\begin{equation}
\label{eq:par3}
\hat{\phi}^j = \phi^z_{best},
\end{equation}
where $z\sim U(1,2,\ldots,N)$, and $\bm{\hat{\phi}_{best}}$ stands for the best harmony.
\section*{Acknowledgments}
The authors are grateful to FAPESP grants \#2013/20387-7 and \#2014/16250-9, as well as CNPq grants \#470571/2013-6 and \#306166/2014-3.