SAIS Exjobbspris 2011

Vinnaren av SAIS exjobbspris 2011 är Filtering Algorithms for Discrete Cumulative Resources av Joseph Scott från Uppsala universitet. Handledare är Mats Carlsson, SICS och exminator Justin Pearson, Uppsala universitet. Totalt nominerades 5 högkvalitativa exjobb.

Joseph kommer att motta priset och presentera sitt arbete onsdag 25/5 kl 14.15 under SCAI.

Motiveringen lyder: The award goes to Joseph Scott for a thesis that advances the state-of-the-art in constraint programming, a core field of Artificial Intelligence. With a focus on constraint-based scheduling, he provides a rigorous critical analysis of the best known algorithm for cumulative edge finding that won the best paper award at CP’09. He infers some of the aspects of that algorithm that were discussed too briefly or not at all, he corrects several non-trivial mistakes, and he proposes several extensions as well as run-time improvements. The thesis is very well written and is at the level of a good research paper, much above that of the average Master’s thesis.

This entry was posted in sais. Bookmark the permalink.