Sciweavers

727 search results - page 93 / 146
» A Calculus of Bounded Capacities
Sort
View
TIT
2002
64views more  TIT 2002»
15 years 4 months ago
An information-theoretic and game-theoretic study of timing channels
This paper focuses on jammed timing channels. Pure delay jammers with a maximum delay constraint, an average delay constraint, or a maximum buffer size constraint are explored, for...
James Giles, Bruce Hajek
CORR
2007
Springer
111views Education» more  CORR 2007»
15 years 4 months ago
Resource Allocation for Wireless Fading Relay Channels: Max-Min Solution
—Resource allocation is investigated for fading relay channels under separate power constraints at the source and relay nodes. As a basic information-theoretic model for fading r...
Yingbin Liang, Venugopal V. Veeravalli, H. Vincent...
MEMOCODE
2003
IEEE
15 years 9 months ago
Methods for exploiting SAT solvers in unbounded model checking
— Modern SAT solvers have proved highly successful in finding counterexamples to temporal properties of systems, using a method known as ”bounded model checking”. It is natu...
Kenneth L. McMillan
CDC
2009
IEEE
151views Control Systems» more  CDC 2009»
15 years 9 months ago
Shortest path optimization under limited information
— The problem of finding an optimal path in an uncertain graph arises in numerous applications, including network routing, path-planning for vehicles, and the control of finite...
Michael Rinehart, Munther A. Dahleh
STOC
2000
ACM
123views Algorithms» more  STOC 2000»
15 years 8 months ago
List decoding algorithms for certain concatenated codes
We give efficient (polynomial-time) list-decoding algorithms for certain families of errorcorrecting codes obtained by "concatenation". Specifically, we give list-decodi...
Venkatesan Guruswami, Madhu Sudan