From 872eb4b3cd26c8640a45b55ea406f2a77f269971 Mon Sep 17 00:00:00 2001 From: "Jip J. Dekker" Date: Thu, 17 May 2018 11:19:30 +1000 Subject: [PATCH] Add introduction --- wk10/week10.tex | 12 ++++++++++-- 1 file changed, 10 insertions(+), 2 deletions(-) diff --git a/wk10/week10.tex b/wk10/week10.tex index be33d2b..5c96010 100644 --- a/wk10/week10.tex +++ b/wk10/week10.tex @@ -26,8 +26,16 @@ \author{Kelvin Davis \and Jip J. Dekker\and Tony Silvestere} \maketitle - \section{Overview} - + \section{Introduction} + For a lot of research comparisons are made between different algorithms. Why + is one algorithm better than another? Programming will generally teach you + that an algorithm is better if it can be executed faster, but this is not + always true. The behaviour of different algorithms must be studied in relation + to its input and it gets even more complicated when random values are used. In + this assignment we will compare two algorithms for the ``Dawkin's weasel'' + problem. Both algorithms are based on randomisation: the first algorithm is a + simple hill climbing algorithm and the second algorithm is a genetic + algorithm. \section{Methodology} % Describe methods