We present an approximate analytical method to compute efficiently the call blocking probabilities in wavelength routing networks with multiple classes of calls. The model is fairl...
Sridhar Ramesh, George N. Rouskas, Harry G. Perros
We study the dynamics of the Naming Game [Baronchelli et al., (2006) J. Stat. Mech.: Theory Exp. P06014] in empirical social networks. This stylized agentbased model captures essen...
—A whole calibration test process of Stewart platform including the error analysis, calibration model, measure process, data analysis, parameter errors determination and the iter...
Abstract. We compare the expressive power of process calculi by studying the problem of electing a leader in a symmetric network of processes. We consider the π-calculus with mixe...
Maria Grazia Vigliotti, Iain Phillips, Catuscia Pa...
Abstract—This paper presents a novel study on how to distribute neural networks in a wireless sensor networks (WSNs) such that the energy consumption is minimized while improving...