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
Zhifei Zheng, Sami Cherif, Matthieu Py, Rui Shibasaki, Chu-Min Li, Laurent Deroussi, Nathalie Grangeon - 1 août 2026
Balancing power with logic: Exact satisfiability-based methods for energy-aware assembly lines
Computers and Operations Research
Quentin Bramas, Stéphane Devismes, Anaïs Durand, Pascal Lafourcade, Anissa Lamani - 2 septembre 2026
Optimal asynchronous perpetual finite grid exploration
Theoretical Computer Science
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
Aya Ferchichi, Ali Ben Abbes, Vincent Barra, Imed Riadh Farah - 1 octobre 2026
SYNAPSE: A multi-agent LLM framework with parameter-free cross-attention fusion for interpretable multimodal spatio-temporal forecasting
Neurocomputing
Polynomial-time algorithms for Path Cover and Path Partition on trees and graphs of bounded treewidth
Theoretical Computer Science
Zhifei Zheng, Sami Cherif, Matthieu Py, Rui Shibasaki, Chu-Min Li, Laurent Deroussi, Nathalie Grangeon - 1 août 2026
Balancing power with logic: Exact satisfiability-based methods for energy-aware assembly lines
Computers and Operations Research
Quentin Bramas, Stéphane Devismes, Anaïs Durand, Pascal Lafourcade, Anissa Lamani - 2 septembre 2026
Optimal asynchronous perpetual finite grid exploration
Theoretical Computer Science
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
Aya Ferchichi, Ali Ben Abbes, Vincent Barra, Imed Riadh Farah - 1 octobre 2026
SYNAPSE: A multi-agent LLM framework with parameter-free cross-attention fusion for interpretable multimodal spatio-temporal forecasting
Neurocomputing