Sciweavers

580 search results - page 48 / 116
» Choosing a random peer
Sort
View
COCO
1994
Springer
140views Algorithms» more  COCO 1994»
15 years 3 months ago
Random Debaters and the Hardness of Approximating Stochastic Functions
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
Anne Condon, Joan Feigenbaum, Carsten Lund, Peter ...
CORR
2011
Springer
159views Education» more  CORR 2011»
14 years 6 months ago
How to Play Unique Games against a Semi-Random Adversary
In this paper, we study the average case complexity of the Unique Games problem. We propose a natural semi-random model, in which a unique game instance is generated in several st...
Alexandra Kolla, Konstantin Makarychev, Yury Makar...
TWC
2010
14 years 6 months ago
Efficient Spectrum Leasing via Randomized Silencing of Secondary Users
In this paper, a primary (licensed) user leases part of its resources to independent secondary (unlicensed) terminals in exchange for a tariff in dollars per bit, under the constra...
Rocco Di Taranto, Petar Popovski, Osvaldo Simeone,...
MSOM
2010
65views more  MSOM 2010»
14 years 6 months ago
The Optimal Composition of Influenza Vaccines Subject to Random Production Yields
The Vaccine and Related Biologic Products Advisory Committee meets at least once a year to decide the composition of the influenza vaccine in the U.S. Past evidence suggests that ...
Soo-Haeng Cho
STACS
2007
Springer
15 years 6 months ago
Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs
One frequently studied problem in the context of information dissemination in communication networks is the broadcasting problem. In this paper, we study the following randomized b...
Robert Elsässer, Thomas Sauerwald