Only recently, progress has been made in obtaining o(log (rank))-competitive algorithms for the matroid secretary problem. More precisely, Chakraborty and Lachish ...

Online learning and competitive analysis are two widely studied frameworks for online decision-making settings. Despite the frequent similarity of the problems they study, there are significant ...

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

A Northwestern competitive programming team won third place in the Mid-Central USA Regional International Collegiate Programming Contest (ICPC) held on February 25 at Purdue University Northwest – ...