374 search results - page 8 / 75 » On Communicating Automata with Bounded Channels |
109
click to vote
INFOCOM
1998
IEEE
1998
IEEE
Performance Bounds for Dynamic Channel Assignment Schemes Operating under Varying Re-Use Constraints
15 years 3 months ago
-We derive bounds for the performance of dynamic channel assignment (DCA) schemeswhich strengthenthe existing Erlang bound. The construction of the bounds is based on a reward para...
FOCS
2006
IEEE
15 years 5 months ago
2006
IEEE
We establish the exact threshold for the reconstruction problem for a binary asymmetric channel on the b-ary tree, provided that the asymmetry is sufficiently small. This is the ...
ESOP
2008
Springer
15 years 1 months ago
2008
Springer
We present a static analysis for inferring the maximum amount of buffer space used by a program consisting of concurrently running processes communicating via buffered channels. We...
91
Voted
GLOBECOM
2008
IEEE
15 years 22 days ago
2008
IEEE
—The probability of a miss in the detection of a signal in an optical communications system through the turbulent atmosphere using intensity modulation is studied. The turbulence...
GLOBECOM
2008
IEEE
15 years 6 months ago
2008
IEEE
—We propose a non-coherent receiver for the fixed detect-and-forward relay channel and derive a closed-form tight upper bound on its bit error probability in Rayleigh fading cha...