Abstract: Real-time applications, such as ticket booking systems, video streaming systems, social networking services, and online games, are prevalent nowadays. Low latency between a user and a server ...

Abstract: The almost sure convergence of two time-scale stochastic approximation algorithms is analyzed under general noise and stability conditions. In the context of the Lyapunov stability, the ...

The travelling salesman problem (TSP) remains one of the most challenging NP‐hard problems in combinatorial optimisation, with significant implications for logistics, network design and route planning ...

This course studies approximation algorithms – algorithms that are used for solving hard optimization problems. Such algorithms find approximate (slightly suboptimal) solutions to optimization ...

This project explores the NP-hard problem of scheduling unrelated parallel machines, a significant challenge in optimizing resource utilization. Specifically, it focuses on efficiently assigning ...

This research has been supported in part by the Air Force of Scientific Research through Award FA9550-12-1-0199. ‡ A portion of the research was conducted at Gran Sasso Institute, School of Advanced ...