374 search results - page 16 / 75 » On Communicating Automata with Bounded Channels |
172
click to vote
TSP
2008
15 years 5 months ago
2008
We consider the problem of decentralized detection in failure-prone tree networks with bounded height. Specifically, we study and contrast the impact on the detection performance o...
149
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
-- The performance of maximum-likelihood (ML) decoded binary linear block codes is addressed via the derivation of tightened upper bounds on their decoding error probability. The u...
161
click to vote
ASP
2001
Springer
15 years 10 months ago
2001
Springer
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. This is an extension of earlier w...
135
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract-- A green code attempts to minimize the total energy per-bit required to communicate across a noisy channel. The classical information-theoretic approach neglects the ener...
110
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
In this paper we study the spectrum of certain large random Hermitian Jacobi matrices. These matrices are known to describe certain communication setups. In particular we are inte...