Banach spaces, as complete normed vector spaces, form a central framework in modern functional analysis. Their rich geometric structure underpins much of the theoretical development in approximation ...

What algorithms should an air defense system work with? Particle swarm algorithms if there are ten targets to be hit. If there are more than ten targets, greedy algorithms work best. These findings ...

A comparison and evaluation is made of recent proposals for multivariate matched sampling in observational studies, where the following three questions are answered: (1) Algorithms: In current ...

This is an advanced undergraduate course on algorithms. This course examines such topics as greedy algorithms, dynamic programming, graph algorithms, string processing, and algorithms for ...

We consider the expected performance of two greedy matching algorithms on sparse random graphs and also on random trees. In all cases we establish expressions for the mean and variance of the number ...

*Note: This course description is only applicable for the Computer Science Post-Baccalaureate program. Additionally, students must always refer to course syllabus for the most up to date information.

This course is compulsory on the MSc in Mathematics and Computation. This course is available on the MPA in Data Science for Public Policy, MSc in Data Science, MSc in Operations Research & Analytics, ...