In this paper, we prove polynomial running time bounds for an Ant Colony Optimization (ACO) algorithm for the single-destination shortest path problem on directed acyclic graphs. ...
Abstract— Side channel attacks such as Simple Power Analysis(SPA) attacks provide a new challenge for securing algorithms from an attacker. Algorithms for elliptic curve point sc...
Andrew Byrne, Nicolas Meloni, Arnaud Tisserand, Em...
Abstract— Rate adaptation plays a key role in determining the performance of wireless LANs. In this paper, we introduce a semi-Markovian framework to analyze the performance of t...
Abstract—A multicast flow control framework for data traffic traversing both a wired and wireless network is proposed. Markov-modulated fluid (MMF) models are used for the rec...
In this paper we present a method of parameter optimization, relative trust-region learning, where the trust-region method and the relative optimization [21] are jointly exploited...