8 Mai - 14 Mai


Retour à la vue des calendrier
Mardi 9 Mai
Heure: 12:30 - 13:30
Lieu: Salle B107, bâtiment B, Université de Villetaneuse
Résumé: Derivative-Free Line search Methods for Solving Integer Programming Problems
Description: Francesco Rinaldi In this talk, we describe some derivative-free methods for integer programming problems with both bound constraints on the variables and general nonlinear c onstraints. The approaches combine linesearches with a specific penalty approach for handling the nonlinear constraints. The use of both suitable generated search directions and specific stepsizes in the linesearch guarantee that all the points are generated in the integer lattice.

We analyze the theoretical properties of the methods and show extensive numerical experiments on both bound constrained and nonlinearly constrained problems.
Heure: 14:00 - 17:00
Lieu: Salle B107, bâtiment B, Université de Villetaneuse
Résumé: Random graphs and average-case analysis of NP-complete problems
Description: Tom Denat
Jeudi 11 Mai
Heure: 12:15 - 13:30
Lieu: Salle B107, bâtiment B, Université de Villetaneuse
Résumé: Accountable classification without frontiers
Description: Khaled Belahcen We address the problem of multicriteria ordinal sorting through the lens of accountability, i.e. the ability of a human decision-maker to own a recommendation made by the system. We put forward a number of model features that would favor the capability to support the recommendation with a convincing explanation. To account for that, we design a recommender system implementing and formalizing such features. This system outputs explanations defined under the form of specific argument schemes tailored to represent the specific rules of the model. At the end, we discuss possible and promising argumentative perspectives.
Vendredi 12 Mai
Heure: 11:00 - 12:30
Lieu: Salle B107, bâtiment B, Université de Villetaneuse
Résumé: Monades et comonades (suite)
Description: Flavien Breuvart Dans cette deuxième séance du GdT modades et comonades, je
présenterais les monades et comonades gradées. J'insisterais, en
particulier, sur ma vision de ces objets comme potentielle piste pour
faire interagir interprétation abstraite et typage dans les langages
fonctionnels.