Skip to content
Browse files

fixed typo in iterated local search description

  • Loading branch information...
1 parent b1eaf21 commit 89de3731477c88ed6744b930f77fe41b43e92e3a @jbrownlee committed Jun 9, 2011
Showing with 7 additions and 3 deletions.
  1. +2 −0 .gitignore
  2. +1 −1 book/a_stochastic/iterated_local_search.tex
  3. +1 −0 book/b_errata.tex
  4. +3 −2 book/f_acknowledgments.tex
View
2 .gitignore
@@ -29,3 +29,5 @@ src/algorithms/*.log
web/docs
web/epub_temp
web/*.epub
+**/*~
+**/*/*~
View
2 book/a_stochastic/iterated_local_search.tex
@@ -24,7 +24,7 @@ \subsection{Taxonomy}
% To what fields of study does a technique belong?
Iterated Local Search is a Metaheuristic and a Global Optimization technique.
% What are the closely related approaches to a technique?
-It is an extension of Mutli Start Search and may be considered a parent of many two-phase search approaches such as the Greedy Randomized Adaptive Search Procedure (Section~\ref{sec:grasp}) and Variable Neighborhood Search (Section~\ref{sec:variable_neighborhood_search}).
+It is an extension of Mutli-Restart Search and may be considered a parent of many two-phase search approaches such as the Greedy Randomized Adaptive Search Procedure (Section~\ref{sec:grasp}) and Variable Neighborhood Search (Section~\ref{sec:variable_neighborhood_search}).
% Strategy: Problem solving plan
% The strategy is an abstract description of the computational model. The strategy describes the information processing actions a technique shall take in order to achieve an objective. The strategy provides a logical separation between a computational realization (procedure) and a analogous system (metaphor). A given problem solving strategy may be realized as one of a number specific algorithms or problem solving systems. The strategy description is textual using information processing and algorithmic terminology.
View
1 book/b_errata.tex
@@ -16,6 +16,7 @@ \section*{First Edition, Revision 1}
\item[page 13] Typo in the Function Approximation section of the Introduction. Thanks to Patrick Boehnke.
\item[page 32] Typo in References section of Random Search.
\item[page 37] Fixed bug with \texttt{step_size} in Adaptive Random Search implementation. Thanks to Zach Scott.
+ \item[page 43] Typo in Taxonomy section of Iterated Local Search. Thanks to Diego Noble.
\item[page 235] Fixed a bug in the \texttt{get\_global\_best} function of the Particle Swarm Optimization implementation. Thanks to Paul Chinnery.
\item[page 242] Fixed a bug in the \texttt{search} function of the Ant System implementation. Thanks to Andrew Myers.
\item[page 415] Changed equality to assignment in Ruby flow control example in Appendix A. Thanks to Donald Doherty.
View
5 book/f_acknowledgments.tex
@@ -27,8 +27,9 @@ \chapter*{Acknowledgments\markboth{Acknowledgments}{}}
Paul Chinnery,
Donald Doherty,
Brook Tamir,
-and
-Zach Scott
+Zach Scott,
+and
+Diego Noble.
% cover voting
Thanks to the hundreds of machine learning enthusiasts who voted on potential covers and helped shape what this book became. You know who you are!

0 comments on commit 89de373

Please sign in to comment.
Something went wrong with that request. Please try again.