4674 search results - page 785 / 935 » cases 2008 |
148
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract--A delay-constrained scheduling problem for pointto-point communication is considered: a packet of B bits must be transmitted by a hard deadline of T slots over a timevary...
133
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We define a class of Z-interference channels for which we obtain a new upper bound on the capacity region. The bound exploits a technique first introduced by Korner and Marton. A ...
121
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
In this article we review standard null-move pruning and introduce our extended version of it, which we call verified null-move pruning. In verified null-move pruning, whenever th...
147
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We prove that every computably enumerable (c.e.) random real is provable in Peano Arithmetic (PA) to be c.e. random. A major step in the proof is to show that the theorem stating ...
190
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We develop a general game-theoretic framework for reasoning about strategic agents performing possibly costly computation. In this framework, many traditional game-theoretic resul...