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 ...

Probabilistic programming has emerged as a powerful paradigm that integrates uncertainty directly into computational models. By embedding probabilistic constructs into conventional programming ...

Algorithm design and analysis is fundamental to all areas of computer science and gives a rigorous framework for the study optimization. This course provides an introduction to algorithm design ...

In this paper, we propose a new branch and bound algorithm for the solution of large scale separable concave programming problems. The largest distance bisection (LDB) technique is proposed to divide ...

In this paper, we propose a reference direction approach and an interactive algorithm to solve the general multiple objective integer linear programming problem. At each iteration, only one mixed ...

Students gain advanced knowledge of algorithms; computational biology; computer architecture; computer graphics and visualization; computer systems design; database systems; computer security; ...