output
20202025
most citedConfiguring an heterogeneous smartgrid network: complexity and approximations for tree topologies

4 citations

6 papers

math.OC2025

Efficient Solving of Large Single Input Superstate Decomposable Markovian Decision Process

Youssef Ait El Mahjoub, Jean-Michel Fourneau, Salma Alouah

Solving Markov Decision Processes (MDPs) remains a central challenge in sequential decision-making, especially when dealing with large state spaces and long-term optimization crite…

cs.CV2024

OneEncoder: A Lightweight Framework for Progressive Alignment of Modalities

Bilal Faye, Hanane Azzag, Mustapha Lebbah

Cross-modal alignment Learning integrates information from different modalities like text, image, audio and video to create unified models. This approach develops shared representa…

cs.LG2024

Evaluating the Efficacy of Instance Incremental vs. Batch Learning in Delayed Label Environments: An Empirical Study on Tabular Data Streaming for Fraud Detection

Kodjo Mawuena Amekoe, Mustapha Lebbah, Gregoire Jaffre +2

Real-world tabular learning production scenarios typically involve evolving data streams, where data arrives continuously and its distribution may change over time. In such a setti…

cs.CC20234 cited

Configuring an heterogeneous smartgrid network: complexity and approximations for tree topologies

Dominique Barth, Thierry Mautor, Dimitri Watel +1

We address the problem of configuring a power distribution network with reliability and resilience objectives by satisfying the demands of the consumers and saturating each product…

cs.LG20231 cited

DBSCAN of Multi-Slice Clustering for Third-Order Tensors

Dina Faneva Andriantsiory, Joseph Ben Geloun, Mustapha Lebbah

Several methods for triclustering three-dimensional data require the cluster size or the number of clusters in each dimension to be specified. To address this issue, the Multi-Slic…

cs.GT2020

Flexibility can hurt dynamic matching system performance

Arnaud Cadas, Josu Doncel, Jean-Michel Fourneau +1

We study the performance of general dynamic matching models. This model is defined by a connected graph, where nodes represent the class of items and the edges the compatibilities…