Sciweavers

462 search results - page 22 / 93
» Symbolic Bounded Synthesis
Sort
View
WCNC
2010
IEEE
15 years 5 months ago
Performance Bounds for AF Multi-Hop Relaying over Nakagami Fading
Abstract—This paper presents a new upper bound on the endto-end signal-to-noise ratio (SNR) of channel-assisted amplifyand-forward (AF) multi-hop relay networks. The harmonic mea...
Gayan Amarasuriya, Chintha Tellambura, Masoud Arda...
115
Voted
DCC
2008
IEEE
16 years 1 months ago
A Lower Bound on the Redundancy of Arithmetic-Type Delay Constrained Coding
In a previous paper we derived an upper bound on the redundancy of an arithmetic-type encoder for a memoryless source, designed to meet a finite endto-end strict delay constraint....
Eado Meron, Ofer Shayevitz, Meir Feder, Ram Zamir
CAV
2008
Springer
108views Hardware» more  CAV 2008»
15 years 3 months ago
Reducing Concurrent Analysis Under a Context Bound to Sequential Analysis
This paper addresses the analysis of concurrent programs with shared memory. Such an analysis is undecidable in the presence of multiple procedures. One approach used in recent wor...
Akash Lal, Thomas W. Reps
DCC
2007
IEEE
16 years 1 months ago
Bounds on Redundancy in Constrained Delay Arithmetic Coding
We address the problem of a finite delay constraint in an arithmetic coding system. Due to the nature of the arithmetic coding process, source sequences causing arbitrarily large ...
Ofer Shayevitz, Eado Meron, Meir Feder, Ram Zamir
QEST
2007
IEEE
15 years 8 months ago
Symbolic Bisimulations for Probabilistic Systems
The paper introduces symbolic bisimulations for a simple probabilistic π-calculus to overcome the infinite branching problem that still exists in checking ground bisimulations b...
Peng Wu 0002, Catuscia Palamidessi, Huimin Lin