Sciweavers

2403 search results - page 214 / 481
» Optimal Randomized RANSAC
Sort
View
CORR
2007
Springer
126views Education» more  CORR 2007»
15 years 3 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
103
Voted
MANSCI
2008
75views more  MANSCI 2008»
15 years 3 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
132
Voted
ALGORITHMICA
1998
81views more  ALGORITHMICA 1998»
15 years 3 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
167
Voted
ANTSW
2010
Springer
15 years 1 months ago
Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem
Ant colony optimization (ACO) has been widely used for different combinatorial optimization problems. In this paper, we investigate ACO algorithms with respect to their runtime beh...
Timo Kötzing, Frank Neumann, Heiko Rögli...
130
Voted
CORR
2011
Springer
188views Education» more  CORR 2011»
14 years 10 months ago
Planar Cycle Covering Graphs
We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every...
Julian Yarkony, Alexander T. Ihler, Charless C. Fo...