Dekker1/ResearchMethods
Archived
1
0
Fork 0
Code

Merge branch 'master' of https://github.com/Dekker1/ResearchMethods

Browse Source
This commit is contained in:
Silver-T 2018-05-17 14:48:28 +10:00
commit f6a0fa74bf
1 changed files with 10 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
wk10/week10.tex
View File

@ -26,8 +26,16 @@
\author{Kelvin Davis \and Jip J. Dekker\and Anthony 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{Hill Climbing and Genetic Algorithms}
% Describe methods