Sciweavers

3422 search results - page 348 / 685
» Random Subset Optimization
Sort
View
DKE
2008
72views more  DKE 2008»
15 years 4 months ago
On space constrained set selection problems
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
FUIN
2006
139views more  FUIN 2006»
15 years 4 months ago
Efficient Parallel Query Processing by Graph Ranking
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...
Dariusz Dereniowski, Marek Kubale
CORR
2007
Springer
126views Education» more  CORR 2007»
15 years 4 months ago
Diversity-Multiplexing Tradeoff in Selective-Fading MIMO Channels
— 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 ...
Pedro Coronel, Helmut Bölcskei
MANSCI
2008
75views more  MANSCI 2008»
15 years 4 months ago
Staffing Multiskill Call Centers via Linear Programming and Simulation
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...
Mehmet Tolga Çezik, Pierre L'Ecuyer
ALGORITHMICA
1998
81views more  ALGORITHMICA 1998»
15 years 4 months ago
The List Update Problem: Improved Bounds for the Counter Scheme
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 ...
Hadas Shachnai, Micha Hofri