We show that the graph isomorphism problem is hard under DLOGTIME uniform AC0 many-one reductions for the complexity classes NL, PL (probabilistic logarithmic space) for every loga...
The problem of minimizing the rank of a matrix subject to linear equality constraints arises in applications in machine learning, dimensionality reduction, and control theory, and...
— This paper explores the variations in mean queue length for stationary arrival processes with the same mean and autocorrelation functions, or equivalently, the same mean and po...
Call control features (e.g., call-divert, voice-mail) are primitive options to which users can subscribe off-line to personalise their service. The configuration of a feature su...
David Lesaint, Deepak Mehta, Barry O'Sullivan, Lui...
We study an integrated supply chain design problem that determines the locations of retailers and the assignments of customers to retailers in order to minimize the expected costs...