Microsoft

Branch-and-Bound Solves Random Binary IPs in Polytime

Branch-and-bound is the workhorse of all state-of-the-art mixed integer linear programming (MILP) solvers. These implementations of branch-and-bound typically use variable branching, that is, the ...
IEEE

An Efficient Branch-and-Bound Routing Algorithm for Optical NoCs

Abstract: Silicon photonics based optical networks-on-chip (ONoCs) are emerging as a power-efficient on-chip communication architecture for the next generation of chip multiprocessors. However, the ...
GitHub

FIFO-Diffusion: Generating Infinite Videos from Text without Training (NeurIPS 2024)

[2024.09.26] 👏👏👏 Our paper has been accepted to NeurIPS 2024!!! [2024.06.06] 🔥🔥🔥 We are excited to release the code for Open-Sora Plan v1.1.0. Thanks to the authors for open-sourcing the awesome ...
IEEE

Online Distributed Algorithms for Online Noncooperative Games With Stochastic Cost Functions: High Probability Bound of Regrets

Abstract: In this article, online noncooperative games without full decision information are studied, where the goal of players is to seek the Nash equilibria in a distributed manner. Different from ...