Difference between revisions of "ISC-4221"
Peter Beerli (talk | contribs) |
Peter Beerli (talk | contribs) |
||
| Line 2: | Line 2: | ||
[[File:feynman_quote.png|left|top]] | [[File:feynman_quote.png|left|top]] | ||
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. | 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. | ||
| + | |||
| + | '''This class will be taught again in FALL 2014, revised syllabus and schedule will be available mid August''' | ||
<br> | <br> | ||
Revision as of 04:52, 25 April 2014
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.
This class will be taught again in FALL 2014, revised syllabus and schedule will be available mid August
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.
