Space constrained optimization problems arise in a variety of applications, ranging from databases to ubiquitous computing. Typically, these problems involve selecting a set of it...
Themis Palpanas, Nick Koudas, Alberto O. Mendelzon
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
— We establish the optimal diversity-multiplexing (DM) tradeoff of coherent time, frequency and time-frequency selective-fading MIMO channels and provide a code design criterion ...
We study an iterative cutting-plane algorithm on an integer program, for minimizing the staffing costs of a multiskill call center subject to service-level requirements which are e...
We consider the problem of dynamic reorganization of a linear list, where requests for the elements are generated randomly with fixed, unknown probabilities. The objective is to ...