output
20152025
most citedEfficient enumeration of solutions produced by closure operations

10 citations

15 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…

math.OC2024

A slot-based energy storage decision-making approach for optimal Off-Grid telecommunication operator

Youssef Ait El Mahjoub, Jean-Michel Fourneau

This paper proposes a slot-based energy storage approach for decision-making in the context of an Off-Grid telecommunication operator. We consider network systems powered by solar…

cs.LG2024

Game Theory Meets Statistical Mechanics in Deep Learning Design

Djamel Bouchaffra, Fayçal Ykhlef, Bilal Faye +2

We present a novel deep graphical representation that seamlessly merges principles of game theory with laws of statistical mechanics. It performs feature extraction, dimensionality…

cs.CL2024

Manual Verbalizer Enrichment for Few-Shot Text Classification

Quang Anh Nguyen, Nadi Tomeh, Mustapha Lebbah +3

With the continuous development of pre-trained language models, prompt-based training becomes a well-adopted paradigm that drastically improves the exploitation of models for many…

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…

stat.ML2023

Distributed Collapsed Gibbs Sampler for Dirichlet Process Mixture Models in Federated Learning

Reda Khoufache, Mustapha Lebbah, Hanene Azzag +2

Dirichlet Process Mixture Models (DPMMs) are widely used to address clustering problems. Their main advantage lies in their ability to automatically estimate the number of clusters…

cs.CC2023★ 4 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.LG2023★ 1 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…

cs.CC2018★ 1 cited

Enumerating models of DNF faster: breaking the dependency on the formula size

Florent Capelli, Yann Strozecki

In this article, we study the problem of enumerating the models of DNF formulas. The aim is to provide enumeration algorithms with a delay that depends polynomially on the size of…

cs.CC2017★ 10 cited

Efficient enumeration of solutions produced by closure operations

Arnaud Mary, Yann Strozecki

In this paper we address the problem of generating all elements obtained by the saturation of an initial set by some operations. More precisely, we prove that we can generate the c…

cs.CC2017★ 2 cited

On The Complexity of Enumeration

Florent Capelli, Yann Strozecki

We investigate the relationship between several enumeration complexity classes and focus in particular on problems having enumeration algorithms with incremental and polynomial del…

math.CO2015

2-Xor revisited: satisfiability and probabilities of functions

Élie de Panafieu, Danièle Gardy, Bernhard Gittenberger +1

The problem 2-Xor-Sat asks for the probability that a random expression, built as a conjunction of clauses , is satisfiable. We revisit this classical problem by giving…

cs.CC2015★ 10 cited

Efficient enumeration of solutions produced by closure operations

Arnaud Mary, Yann Strozecki

In this paper we address the problem of generating all elements obtained by the saturation of an initial set by some operations. More precisely, we prove that we can generate the c…