At a glance... |
Syllabus |
Models |
Code |
Lecturer
- In a few lines, define ordered and unordered search. In what way are they different?
- In a few lines, compare and contrast: (1) Greedy search; (2) Local Search; and (3) Stochastic search. What, if any, are the trade-offs in using a Stochastic search?
- In about 10 lines, write down the pseudo-code for SA. Number each line.
- In the pseudo-code for SA, you used a neighbourhood function
Neighbour(). Write down an expression for this. -
- In the pseudo-code for SA, you used a probability function
P(e_new, e_old, t). What would be a valid mathematical expression for this?
- In the pseudo-code for SA, you used a probability function
- With respect to function
P(e_new, e_old, t), justify the following statements:- Initially, SA is like a drunk, then it sobers up.
- SA consumes lower memory.
- How would you terminate a stochastic algorithms such as SA sooner? (HINT: Look at variances of epochs)
- When finding a solution, you can either mutate towards ''Heaven'' (A better spot) or you can choose to mutate away from "Hell" (A worse spot). Why would you choose one over the other? (HINT: One of them has a better diversity of search.)
Copyright © 2015 Tim Menzies.
This is free and unencumbered software released into the public domain.
For more details, see the license.