Abstract: In this paper we present a novel procedure for multi-frame detection in radar systems. The proposed architecture consists of a pre-processing stage, which extracts a set of candidate alarms ...

The area of approximation algorithms is aimed at giving provable guarantees on the performance of heuristics for hard problems. The course will present general techniques (such as convex ...

Professor of Management Science Associate Dean for Research and Innovation Maria Paola Scaparra is a Professor of Management Science and a member of the Centre for Logistics and Heuristic Optimisation ...

Abstract: TSP is a well-known NP-hard problem. Although many algorithms for solving TSP, such as linear programming, dynamic programming, genetic algorithm, anneal algorithm, and ACO algorithm have ...

We consider the problem of joint beamforming and discrete motion control for mobile relaying networks in dynamic channel environments. We assume a single source-destination communication pair. We ...

The Locally Competitive Algorithm (LCA) is a biologically plausible computational architecture for sparse coding, where a signal is represented as a linear combination of elements from an ...

With the French government’s policy of stimulating tourism and the 2015 Paris terrorist attacks, in 2017, a total of more than 8.1 million tourists visited the Louvre. So the security of the visitors ...