Abstract. We compare various computational complexity classes defined within the framework of membrane systems, a distributed parallel computing device which is inspired from the f...
Antonio E. Porreca, Giancarlo Mauri, Claudio Zandr...
We present two results for computational models that allow error probabilities close to 1/2. First, most computational complexity classes have an analogous class in communication ...
—In this paper, we present an iterative algorithm for channel complex gains estimation with inter-sub-carrierinterference (ICI) reduction in orthogonal-frequency-divisionmultiple...
Abstract—Recently M¨uller et al. (IEEE J. Select. Areas Commun. 2008) used asymptotic methods from statistical physics to analyze non-linear vector precoding for MIMO broadcast ...
— We consider the problem of distributed scheduling in wireless networks. We present two different algorithms whose performance is arbitrarily close to that of maximal schedules,...