727 search results - page 59 / 146 » A Calculus of Bounded Capacities |
152
click to vote
RTSS
2005
IEEE
15 years 9 months ago
2005
IEEE
We consider the scheduling of a sporadic real-time task system on an identical multiprocessor. Though Pfair algorithms are theoretically optimal for such task systems, in practice...
120
click to vote
COCOON
2007
Springer
15 years 10 months ago
2007
Springer
We propose new algorithms and improved bounds for interference-aware routing in wireless networks. First, we prove that n arbitrarily matched source-destinations pairs with average...
159
click to vote
EUROCRYPT
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. In the bounded-storage model (BSM) for information-theoretically secure encryption and key-agreement one uses a random string R whose length t is greater than the assumed...
144
click to vote
TALG
2008
15 years 4 months ago
2008
In the rectangle stabbing problem we are given a set of axis parallel rectangles and a set of horizontal and vertical lines, and our goal is to find a minimum size subset of lines...
132
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
We consider a multiple access channel (MAC) with channel state information (CSI) non-causally known at some encoders. For simplicity of exposition, we focus on a two-encoder model...