For your chosen paper you will have to implement the algorithm as described in this paper. You have to use Java and you have to use the MOA framework. If the algorithm depends on infra-structure currently missing from MOA, then I might give you permission to do a stand-alone version outside MOA [but in this case you must in your report explain what features MOA is currently lacking].
You will have to submit source code; plus any information necessary for compiling, installing, and running your code; plus a step-by-step guide to one example run of your algorithm together with the expected output for this example run; a brief 4 page report explaining what is interesting about your implementation, e.g. smart data structures used, unclear bits of the original paper or even errors, and your interpretation or resolution; the report should also contain results of some sample runs.
10 source code
5 example run step-by-step guide; install instructions
10 presentation (5-10 minutes: the algorithm, your implementation, results, issues, summary)
Presentations: Friday June 20th, 10am-noon
Hand-in date: Monday June 23th, 23.55pm
Hand-in items are:
On the Tuesday *before* the presentation (June 17th) you will have to send me your draft slides, so that I can give you feedback before the actual presentation.
Generally, if anything is unclear, just ask me.
Also, papers are often incomplete, omitting details, and making exact reconstruction impossible. You can email the authors asking for clarifications, but they might be busy and not answer in time. Then you (or I) will have to make some reasonable decisions.