Recherche
We propose a model for recoverable robust optimization with commitment. Given a combinatorial optimization problem and uncertainty about elements that
Mouna Safir (ENS Lyon) Title: Self-Stabilizing Mutual Exclusion in Dynamic Networks with Bounded Temporal Diameter Abstract: We consider distributed
We present deterministic suffix-reading automata (DSA), a new automaton model over finite words. Our motivation for this model comes from
/Exposé /Talk/ In this talk, we will introduce a novel cooperative game theory model designed to tackle a significant unresolved issue in operations
Maslov’s class K-bar is a fragment of First-Order Logic consisting of formulae in NNF whose variables occurring in the different atoms obey a certain
Timothé Picavet (LaBRI) Title: Local Constant Approximation for Dominating Set on Graphs Excluding Large Minors Abstract: We show that graphs
Title: Bounded Predicates in Description Logics with Counting Abstract: A distinguishing feature of Description Logics (DLs), aimed at dealing with
Ralf Klasing (LaBRI) Title: Greediness is not always a vice: Efficient Discovery Algorithms for Assignment Problems Abstract: Finding a maximum-weight
Chana Weil-Kennedy (CEA List) Title: Parameterized Verification of Distributed Systems Abstract: I am interested in verification of distributed
/Exposé en anglais/Talk in english/ The Alon-Jaeger-Tarsi conjecture states that for any finite field F of size at least 4 and any nonsingular matrix