ISC-4221
Revision as of 13:47, 10 December 2013 by Peter Beerli (talk | contribs)
Discrete Algorithms in Scientific Computing
In this coure we are mainly interested in problems of a discrete nature such as searching for a text string, sorting a list of objects, finding the optimal path between cities, finding the point from a list which is closest to a given point, simulating a random process, etc.
Project presentations are on
Wednesday December 11 2013 at 12:30-2:30
[the project consists of the presentation and a short PDF document that gives a short introduction to the project, the methods you used, results, a short discussion, and references to used materials/papers, package also the computer code as a zip file, email the presentation, PDF, and zip file to me.
