12 citations · 48 across the 12 of their papers we have counts for
17 papers
Refined Kolmogorov Complexity of Analog, Evolving and Stochastic Recurrent Neural Networks
Jérémie Cabessa, Yann Strozecki
We provide a refined characterization of the super-Turing computational power of analog, evolving, and stochastic neural networks based on the Kolmogorov complexity of their real w…
From Amortized to Worst Case Delay in Enumeration Algorithms
Florent Capelli, Yann Strozecki
The quality of enumeration algorithms is often measured by their delay, that is, the maximal time spent between the output of two distinct solutions. If the goal is to enumerate $t…
A Generic Strategy Improvement Method for Simple Stochastic Games
D. Auger, X. Badin de Montjoye, Y. Strozecki
We present a generic strategy iteration algorithm (GSIA) to find an optimal strategy of a simple stochastic game (SSG). We prove the correctness of GSIA, and derive a general compl…
Scheduling periodic messages on a shared link
Maël Guiraud, Yann Strozecki
Cloud-RAN is a recent architecture for mobile networks where the processing units are located in distant data centers while, until now, they were attached to antennas. The main cha…
Deterministic contention management for low latency Cloud RAN over an optical ring
Dominique Barth, Maël Guiraud, Yann Strozecki
The N-GREEN project has for goal to design a low cost optical ring technology with good performances (throughput, latency...) without using expensive end-to-end connections. We stu…
Solving Simple Stochastic Games with few Random Nodes faster using Bland's Rule
David Auger, Pierre Coucheney, Yann Strozecki
The best algorithm so far for solving Simple Stochastic Games is Ludwig's randomized algorithm which works in expected time. We first give a simpler iterative var…