Sciweavers

1449 search results - page 113 / 290
» Self-Randomized Exponentiation Algorithms
Sort
View
GLOBECOM
2007
IEEE
15 years 6 months ago
Multi-Class QoS in 802.11 Networks Using Gentle Decrease of Multiple Contention Windows
—IEEE 802.11 Distributed Coordination Function (DCF) uses a binary exponential backoff algorithm to arbitrate simultaneous channel access by multiple stations. When a station sen...
Bushra Anjum, Zartash Afzal Uzmi
PODC
2012
ACM
13 years 8 months ago
The cost of fault tolerance in multi-party communication complexity
Multi-party communication complexity involves distributed computation of a function over inputs held by multiple distributed players. A key focus of distributed computing research...
Binbin Chen, Haifeng Yu, Yuda Zhao, Phillip B. Gib...
EUROCOLT
1999
Springer
15 years 10 months ago
Query by Committee, Linear Separation and Random Walks
Abstract. Recent works have shown the advantage of using Active Learning methods, such as the Query by Committee (QBC) algorithm, to various learning problems. This class of Algori...
Ran Bachrach, Shai Fine, Eli Shamir
RTSS
1998
IEEE
15 years 10 months ago
Statistical Delay Guarantee of Virtual Clock
In this paper, we derive a statistical delay guarantee of the generalized Virtual Clock scheduling algorithm. We define the concept of an equivalent fluid and packet source and pr...
Pawan Goyal, Harrick M. Vin
LICS
1997
IEEE
15 years 10 months ago
The Complexity of Subtype Entailment for Simple Types
A subtyping 0 is entailed by a set of subtyping constraints C, written C j= 0, if every valuation (mapping of type variables to ground types) that satisfies C also satisfies 0. ...
Fritz Henglein, Jakob Rehof