Sciweavers

5580 search results - page 291 / 1116
» Randomized priority algorithms
Sort
View
MMS
2000
15 years 6 months ago
Dynamic Quota-Based Admission Control with Sub-Rating in Multimedia Servers
An admission control algorithm for a multimedia server is responsible for determining if a new request can be accepted without violating the Quality of Service (QoS) requirements o...
Sheng-Tzong Cheng, Chi-Ming Chen, Ing-Ray Chen
ICML
2010
IEEE
15 years 7 months ago
Efficient Selection of Multiple Bandit Arms: Theory and Practice
We consider the general, widely applicable problem of selecting from n real-valued random variables a subset of size m of those with the highest means, based on as few samples as ...
Shivaram Kalyanakrishnan, Peter Stone
CORR
2006
Springer
101views Education» more  CORR 2006»
15 years 6 months ago
Geographic Gossip: Efficient Aggregation for Sensor Networks
Gossip algorithms for aggregation have recently received significant attention for sensor network applications because of their simplicity and robustness in noisy and uncertain en...
Alexandros G. Dimakis, Anand D. Sarwate, Martin J....
ICASSP
2011
IEEE
14 years 10 months ago
Compressive sampling with a successive approximation ADC architecture
This paper proposes a compressive sampling scheme based on random temporal sampling using a successive approximation register (SAR) ADC architecture. Variable wordlength data samp...
Chenchi Luo, James H. McClellan
CORR
2010
Springer
94views Education» more  CORR 2010»
15 years 6 months ago
The Power of Simple Tabulation Hashing
Randomized algorithms are often enjoyed for their simplicity, but the hash functions used to yield the desired theoretical guarantees are often neither simple nor practical. Here ...
Mihai Patrascu, Mikkel Thorup