Parallélisation d'algorithmes avec un nombre fixe de processeurs
Parallélisation de l'algorithme du chemin critique pour une machine à mémoire partagée
Quantized cooperative output regulation of continuous-time multi-agent systems over switching graph
This paper investigates the problem of quantized cooperative output regulation of linear multi-agent systems with switching graphs. A novel dynamic encoding-decoding scheme with a finite communication bandwidth is designed. Leveraging this scheme, a distributed protocol is proposed, ensuring asymptotic convergence of the tracking error under both bounded and unbounded link failure durations. Compared with the existing quantized control work of MASs, the semi-global assumption of initial conditions...
Remarks on pebble games on graphs
Résolution du problème du multi-rendezvous à l'aide d'un modèle d'algorithme distribué
Solving maximum independent set by asynchronous distributed hopfield-type neural networks
We propose a heuristic for solving the maximum independent set problem for a set of processors in a network with arbitrary topology. We assume an asynchronous model of computation and we use modified Hopfield neural networks to find high quality solutions. We analyze the algorithm in terms of the number of rounds necessary to find admissible solutions both in the worst case (theoretical analysis) and in the average case (experimental Analysis). We show that our heuristic is better than the...
Space-efficient parallel merging
Spatially-distributed coverage optimization and control with limited-range interactions
This paper presents coordination algorithms for groups of mobile agents performing deployment and coverage tasks. As an important modeling constraint, we assume that each mobile agent has a limited sensing or communication radius. Based on the geometry of Voronoi partitions and proximity graphs, we analyze a class of aggregate objective functions and propose coverage algorithms in continuous and discrete time. These algorithms have convergence guarantees and are spatially distributed with respect...
Spatially-distributed coverage optimization and control with limited-range interactions
This paper presents coordination algorithms for groups of mobile agents performing deployment and coverage tasks. As an important modeling constraint, we assume that each mobile agent has a limited sensing or communication radius. Based on the geometry of Voronoi partitions and proximity graphs, we analyze a class of aggregate objective functions and propose coverage algorithms in continuous and discrete time. These algorithms have convergence guarantees and are spatially distributed with...
Two open problems in communication in edge-disjoint paths modes
Wildfires identification: Semantic segmentation using support vector machine classifier
This paper deals with wildfire identification in the Alaska regions as a semantic segmentation task using support vector machine classifiers. Instead of colour information represented by means of BGR channels, we proceed with a normalized reflectance over 152 days so that such time series is assigned to each pixel. We compare models associated with -loss and -loss functions and stopping criteria based on a projected gradient and duality gap in the presented benchmarks.