RÉSUMÉ : Dans ce papier, nous nous intéressons à un cas particulier de planification d’agents sous contraintes d’horaires pour lequel nous menons un certain nombre d’investigations : borne inférieure (relaxation lagrangienne), heuristiques (constructive et approche par génération de coupes) et méthode exacte par décomposition de Benders. Des expérimentations numériques sur des instances réelles...

Let G be a simple graph with n vertices. The coloring complex ∆(G) was defined by Steingrı́msson, and the homology of ∆(G) was shown to be nonzero only in dimension n − 3 by Jonsson. Hanlon recently showed that the Eulerian idempotents provide a decomposition of the homology group Hn−3(∆(G)) where the dimension of the j component in the decomposition, H n−3(∆(G)), equals the absolute value of th...

Let G be a simple graph with n vertices. The coloring complex ∆(G) was defined by Steingrı́msson, and the homology of ∆(G) was shown to be nonzero only in dimension n − 3 by Jonsson. Hanlon recently showed that the Eulerian idempotents provide a decomposition of the homology group Hn−3(∆(G)) where the dimension of the j component in the decomposition, H n−3(∆(G)), equals the absolute value of th...

Étudiant les noms de personnages dans le roman français des années 2010, l’article distingue d’abord plusieurs courants : platitude néo-naturaliste, minimalisme intimiste, humour et fantaisie poétique… Il s’attache surtout, ensuite, à relier évolutions récentes la prosoponymie fictionnelle aux mutations psychosociales inquiétudes ontologiques notre époque. En fin compte, l’abolition du vieux pa...

This report focuses on improving the stability as well as the approximation properties of Reduced Order Models (ROM) based on Proper Orthogonal Decomposition (POD). The ROM is obtained by seeking a solution belonging to the POD subspace and that at the same time minimizes the Navier-Stokes residuals. We propose a modified ROM that directly incorporates the pressure term in the model. The ROM is...

A new message-passing scheme for MRF optimization is proposed in this paper. This scheme inherits better theoretical properties than all other state-of-the-art message passing methods and in practice performs equally well/outperforms them. It is based on the very powerful technique of Dual Decomposition [1] and leads to an elegant and general framework for understanding/designing message-passin...