Présentation
Le Laboratoire d'Informatique, de Modélisation et d'Optimisation des Systèmes (LIMOS) est une Unité Mixte de Recherche (UMR 6158) en informatique, et plus généralement en Sciences et Technologies de l'Information et de la Communication (STIC).
(lire la suite)Séminaires thématiques à venir
|
ALCOLOCO - Adrien Leduque - TSCF (INRAE) - 5 novembre 2026 15:00 - salle A002 Anonymous Multi-Agent Path Finding with Task Duration and Moving After Target |
|
ALCOLOCO - Lucas Lorieau - LIMOS - 5 novembre 2026 15:20 - salle A002 Polynomial pathwidth and algorithms for graphs vertex-coverable by few shortest paths |
Soutenances de thèses
|
Durande Berluskoni KAMGA NGUIFO - 3 novembre 2026 14:00 - Amphi 3 - Pôle commun Apport des motifs graduels à l’explicabilité des modèles boîtes noires de classification |
Dernières Publications
Florent Foucaud, Atrayee Majumder, Tobias Mömke, Aida Roshany-Tabrizi - 21 octobre 2026
Polynomial-time algorithms for Path Cover and Path Partition on trees and graphs of bounded treewidth
Theoretical Computer Science
Mohammadamin Rakeei, Rosario Giustolisi, Gabriele Lenzini, Dhekra Mahmoud, Jannik Dreier, Pascal Lafourcade - 27 août 2026
Secure and verifiable coercion-resistant electronic exam
Journal of Cybersecurity
Xavier Boucher, Sébastien Saetta, Cemre Gunes Şengül-Vautier, Johanna Clerc, Magali Coldefy, Loïc Rohr, Yvonne Quenum, Eric Fakra - 17 septembre 2026
Reducing seclusion and mechanical restraint: a systemic and decision-oriented framework for mental health services
Mental Health Review Journal
Fedi Oueslati, Ali Ben Abbes, Vincent Barra - 5 septembre 2026
Fourier-optimal loss for distortion and time in non-stationary time series forecasting
Information Sciences
Carlos Fernandez Hernandez, Christelle Caillouet, Alexandre Guitton, Oana Iova, Fabrice Valois - 1 octobre 2026
Closing the gap between the things network and the optimal downlink scheduler
Computer Communications
Polynomial-time algorithms for Path Cover and Path Partition on trees and graphs of bounded treewidth
Theoretical Computer Science
Mohammadamin Rakeei, Rosario Giustolisi, Gabriele Lenzini, Dhekra Mahmoud, Jannik Dreier, Pascal Lafourcade - 27 août 2026
Secure and verifiable coercion-resistant electronic exam
Journal of Cybersecurity
Xavier Boucher, Sébastien Saetta, Cemre Gunes Şengül-Vautier, Johanna Clerc, Magali Coldefy, Loïc Rohr, Yvonne Quenum, Eric Fakra - 17 septembre 2026
Reducing seclusion and mechanical restraint: a systemic and decision-oriented framework for mental health services
Mental Health Review Journal
Fedi Oueslati, Ali Ben Abbes, Vincent Barra - 5 septembre 2026
Fourier-optimal loss for distortion and time in non-stationary time series forecasting
Information Sciences
Carlos Fernandez Hernandez, Christelle Caillouet, Alexandre Guitton, Oana Iova, Fabrice Valois - 1 octobre 2026
Closing the gap between the things network and the optimal downlink scheduler
Computer Communications