Sciweavers

4451 search results - page 153 / 891
» On Random Ordering Constraints
Sort
View
IANDC
2011
84views more  IANDC 2011»
14 years 12 months ago
Teaching randomized learners with feedback
The present paper introduces a new model for teaching randomized learners. Our new model, though based on the classical teaching dimension model, allows to study the influence of...
Frank J. Balbach, Thomas Zeugmann
140
Voted
CORR
2011
Springer
179views Education» more  CORR 2011»
14 years 8 months ago
The restricted isometry property for time-frequency structured random matrices
We establish the restricted isometry property for finite dimensional Gabor systems, that is, for families of time–frequency shifts of a randomly chosen window function. We show...
Götz E. Pfander, Holger Rauhut, Joel A. Tropp
ICC
2007
IEEE
15 years 11 months ago
Opportunistic Power Allocation for Random Beamforming in MISO Broadcast Channels
Abstract— This paper proposes the opportunistic power allocation (OPA) scheme for random beamforming with a limited feedback rate. Without the channel state information, the prop...
Edward W. Jang, Hyukjoon Kwon, John M. Cioffi
GECCO
2007
Springer
132views Optimization» more  GECCO 2007»
15 years 11 months ago
Empirical analysis of ideal recombination on random decomposable problems
This paper analyzes the behavior of a selectorecombinative genetic algorithm (GA) with an ideal crossover on a class of random additively decomposable problems (rADPs). Specifical...
Kumara Sastry, Martin Pelikan, David E. Goldberg
155
Voted
COCO
2004
Springer
121views Algorithms» more  COCO 2004»
15 years 10 months ago
Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments
We prove a very general lower bound technique for quantum and randomized query complexity, that is easy to prove as well as to apply. To achieve this, we introduce the use of Kolm...
Sophie Laplante, Frédéric Magniez