Recherche

Alternating timed automata (ATA) are an extension of timed automata where the effect of each transition is described by a positive boolean combination

/Exposé en anglais/Talk in english/ Twin-width is a graph invariant recently introduced by Bonnet, Kim, Thomassé and Watrigant [FOCS'20]. The core

In this talk, we will consider the computational complexity of solving stochastic games with mean-payoff objectives, where ($\epsilon$-)optimal

/Exposé /Talk/ The chromatic number and clique number are well-studied notions that have motivated a significant part of the research in graph theory

Wolfgang-OP: A Robust Humanoid Robot Platform for Research and Competitions Jasper Güldenstein Visio: https://u-bordeaux-fr.zoom.us/j/83483228567

Exposé en anglais / Talk in english There are various parameters used to measure the complexity of posets (partially ordered sets), and many

Guess Random Additive Noise Decoder (GRAND) has emerged as a noise-centric universal decoder in classical systems, enabling low-energy, low-latency

Making synchronous algorithms efficiently self-stabilizing in arbitrary asynchronous environments (continued) This paper deals with the trade-off

Séminaire TAD A Hybrid AI system for fusion of object and context information: application to the rail line defect detection Alexey Zhukov A hybrid
Antoine Pirrone soutiendra sa thèse intitulée : « Apprentissage profond auto-supervisé de métriques : application à la prédiction d'assemblage de