Dynamic routing can substantially enhance the quality of service for multiprocessor communication, and can provide intelligent adaptation of faulty links during run time. Implemen...
Terrence S. T. Mak, N. Pete Sedcole, Peter Y. K. C...
This paper presents a simulation analysis for the evaluation of the admission region of a IEEE 802.11e network adopting the EDCA (Enhanced Distributed Channel Access) mechanism. In...
Rosario Giuseppe Garroppo, Stefano Giordano, Stefa...
We propose Laplace max-margin Markov networks (LapM3 N), and a general class of Bayesian M3 N (BM3 N) of which the LapM3 N is a special case with sparse structural bias, for robus...
— Routing policies used in the Internet tend to be restrictive limiting communication between source-destination pairs to one route, when often better alternates exist. To avoid ...
This work deals with trajectory optimization for a network of robotic sensors sampling a spatio-temporal random field. We examine the problem of minimizing over the space of networ...