You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: part_install.tex
+2-2Lines changed: 2 additions & 2 deletions
Original file line number
Diff line number
Diff line change
@@ -25,13 +25,13 @@
25
25
\begin{itemize}%
26
26
\item install Docker from\\\url{http://www.docker.com/} and do%
27
27
\item\mbox{\codeil{docker run -t -i -p 9999:8080/tcp}} \mbox{\codeil{optimizationbenchmarking/evaluator-gui}}%
28
-
\item open browser to \codeil{http://localhost:9999}%
28
+
\item open browser to \codeil{http://localhost:9999} on Linux, replace \codeil{localhost} with the IP address of the Docker container under Windows or Mac OS%
Copy file name to clipboardExpand all lines: part_introduction.tex
+11-5Lines changed: 11 additions & 5 deletions
Original file line number
Diff line number
Diff line change
@@ -5,11 +5,11 @@ \section{Introduction}%
5
5
\frametitle{Quick Overview}%
6
6
\begin{itemize}%
7
7
\item Concept of optimization algorithms%
8
-
\item<2-> How to benchmark such algorithms%
8
+
\item<2-> How to benchmark optimization algorithms%
9
9
\item<3-> How to evaluate data obtained from benchmarking and how to compare algorithms
10
10
\item<4-> The \optimizationBenchmarking\ Framework can do it for you\only<-4>{!}\only<5->{:}%
11
11
\item<5-> It provides a graphical user interface in a client/server application for loading, editing, and evaluating experimental results.%
12
-
\item<6-> It can run as Docker container under Linux, MacOS?, and Windows? without needing any additional software (except Docker and a browser).%
12
+
\item<6-> It can run as Docker container under Linux, MacOS, and Windows without needing any additional software (except Docker and a browser).%
13
13
\item<7-> It produces reports, similar to articles, in \LaTeX\ with figures and building blocks ready for use in your publications%
14
14
\end{itemize}%
15
15
\end{frame}%
@@ -87,32 +87,38 @@ \section{Introduction}%
87
87
\end{itemize}%
88
88
}%
89
89
%
90
-
\item<10-> \alert{Experimental analysis and comparison only practical alternative.}%
90
+
\item<10-> \alert{Experimental analysis and comparison is the only practical alternative.}%
91
91
%
92
92
\end{itemize}%
93
93
\end{frame}%
94
94
%
95
95
%
96
96
%
97
-
\begin{frame}%
97
+
\begin{frame}[t]%
98
98
\frametitle{Performance and Anytime Algorithms}%
99
99
%
100
100
\emph{\inQuotes{We use metaheuristic optimization algorithms to give us \alert<3->{good approximate solutions} within \alert<4->{acceptable runtime}.}}%
101
101
%
102
102
\uncover<2->{%
103
103
\begin{itemize}%
104
104
\item Algorithm performance has two dimensions\scitep{NAFR2010RPBBOB2ES,WCTLTCMY2014BOAAOSFFTTSP}:\uncover<3->{ solution quality\uncover<4->{ and required runtime}}%
105
+
\only<-9>{%
105
106
\item<5-> Anytime Algorithms\scitep{BD1989STDPP2} are optimization methods which maintain an approximate solution at \emph{any time} during their run and iteratively improve this guess.%
106
107
\item<6-> All metaheuristics are Anytime Algorithms.%
107
108
\item<7-> Several exact methods like Branch-and-Bound\scitep{LMSK1963AAFTTSP,Z1993TBABACSOTATSP,Z1999TAADFBABACSOTATSP} are Anytime Algorithms.%
108
109
\item<8-> Consequence: Most optimization algorithms produce approximate solutions of different qualities at different points during their process.%
109
110
\item<9-> Experiments must capture solution quality and runtime data.%
111
+
}%
112
+
\item<10-> If we just compare \inQuotes{final} results, we may arrive at incomplete \only<12->{or entirely wrong} conclusions%
Copy file name to clipboardExpand all lines: part_maxSatExample.tex
+6-6Lines changed: 6 additions & 6 deletions
Original file line number
Diff line number
Diff line change
@@ -46,11 +46,11 @@ \section{Example: \maxSat}%
46
46
\begin{itemize}%
47
47
\item We want to compare the performance of six algorithms\uncover<2->{:%
48
48
\begin{enumerate}%
49
-
\item 1-flip Hill Climber%
50
-
\item<3-> 1-flip Hill Climber with Restarts%
49
+
\item 1-flip Hill Climber\only<-2>{: starts with a random bit string, flips one of the \maxSatVariables\ bits in each iteration and keeps the new bit string if it is better}%
50
+
\item<3-> 1-flip Hill Climber with Restarts\only<3>{ after $z$ moves without improvements; initially $z=1$ and increased by~$1$ after each restart}%
51
51
\item<4-> 2-flip Hill Climber%
52
-
\item<5-> 2-flip Hill Climber with Restarts
53
-
\item<6-> $m$-flip Hill Climber
52
+
\item<5-> 2-flip Hill Climber with Restarts%
53
+
\item<6-> $m$-flip Hill Climber\only<6>{, $m$ chosen randomly according to geometric distribution}%
54
54
\item<7-> $m$-flip Hill Climber with Restarts%
55
55
%
56
56
\end{enumerate}%
@@ -86,7 +86,7 @@ \section{Example: \maxSat}%
86
86
\item<5-> The problem instances have the following features\uncover<6->{:%
87
87
\begin{itemize}%
88
88
\item\maxSatVariables: the number of variables%
89
-
\item<7-> \maxSatClauses: the number of clauses (related to \maxSatVariables)%
89
+
\item<7-> \maxSatClauses: the number of clauses (here related to \maxSatVariables)%
90
90
\end{itemize}%
91
91
}%
92
92
\end{itemize}%
@@ -301,7 +301,7 @@ \section{Example: \maxSat}%
301
301
%}%
302
302
%
303
303
%\only<6-7>{%
304
-
\item<6-> We specify which benchmark instances we have and what their features are\uncover<7->{: $11\times11$ instances in our example, with features \maxSatVariables\ and \maxSatClauses\uncover<-7>{ (\alert{demo})}}%
304
+
\item<6-> We specify which benchmark instances we have and what their features are\uncover<7->{: $10\times10$ instances in our example, with features \maxSatVariables\ and \maxSatClauses\uncover<-7>{ (\alert{demo})}}%
0 commit comments