This paper addresses the problem of distributed resource allocation in general fork and join processing networks. The problem is motivated by the complicated processing requiremen...
Haiquan (Chuck) Zhao, Cathy H. Xia, Zhen Liu, Dona...
We study a class of generalized bundle methods for which the stabilizing term can be any closed convex function satisfying certain properties. This setting covers several algorithm...
Term-based representations of documents have found widespread use in information retrieval. However, one of the main shortcomings of such methods is that they largely disregard le...
r Numerical Abstractions6 Roberto Bagnaraa , Patricia M. Hillb , Enea Zaffanellaa aDepartment of Mathematics, University of Parma, Italy bSchool of Computing, University of Leeds, ...
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
Online Convex Programming (OCP) is a recently developed model of sequential decision-making in the presence of time-varying uncertainty. In this framework, a decisionmaker selects ...