This course covers basic algorithm design techniques such as divide and conquer, dynamic programming, and greedy algorithms. It concludes with a brief introduction to intractability (NP-completeness) ...

Dynamic optimization and optimal control problems form the backbone of numerous applications in engineering, economics and the natural sciences. These methodologies involve determining a time-varying ...

The background for this paper is a dynamic programming model with a Borel state space and compact action sets. A new simple proof of the compactness of a space of measures corresponding to randomized ...