Main Courses lect. prac. lab. cr. prerequisite Semester 1 (spring) Applications of optimization [1] 2 1 4 Formal methods [2]

This is a set of lecture notes for a graduate class on Monte Carlo methods given at the Courant Institute of Mathematical Sciences at NYU in the fall of 2005 and again in 2007. During these years important new techniques and applications emerged. At the same time, most basic introductions to Monte Carlo are specialized for one of the application disciplines. These notes attempt to present Monte...

A classical theorem of Dirac states that every graph on n vertices with minimum degree at least n/2 contains a Hamilton cycle. If one seeks an analogue of this result for uniform hypergraphs, then several alternatives suggest themselves. In the following, we will restrict ourselves to 3-uniform hypergraphs H. Thus each hyperedge of H consists of precisely 3 vertices. A natural way to extend the...

Main Courses lect. prac. lab. cr. prerequisite Semester 1 (spring) Applications of optimization [1] 2 1 4 Formal methods [2]

Option D. Single instruction multiple data, is a form of domain decomposition where the same instruction is executed on the various parts of the data. The different portions of the data are handled by the multiple processors available. Multiple instruction is various operations being performed on the same data. The different tasks can be allocated to different processors in order to parallelise...

Main Courses lect. prac. lab. cr. prerequisite Semester 1 (spring) Applications of optimization [1] 2 1 4 Formal methods [2]