Convex programming involves a convex set F Rn and a convex cost function c : F R. The goal of convex programming is to find a point in F which minimizes c. In online convex prog...
We analyze the problem of packing squares in an online fashion: Given an semi-infinite strip of width 1 and an unknown sequence of squares with side lengths in [0, 1] that arrive...
For many years, introductory Computer Science courses have followed the same teaching paradigms. These paradigms utilize only simple console windows; more interactive approaches t...
Jesse D. Phillips, Roger V. Hoang, Joseph D. Mahsm...
Abstract—Recent studies have been conducted to indicate the ineffective usage of licensed bands due to the static spectrum allocation. In order to improve the spectrum utilizatio...
Abstract: This paper considers the problem of cooperative power control in distributed small cell wireless networks. We introduce a novel framework, based on repeated games, which ...
Mael Le Treust, Hamidou Tembine, Samson Lasaulce, ...