Zobrazeno 1 - 10
of 149
pro vyhledávání: '"Stróźecki P"'
Autor:
Stróżecki Paweł, Donderski Rafał, Grajewska Magdalena, Marcinkowska Elżbieta, Kozłowski Michał, Pollak Joanna, Odrowąż-Sypniewska Grażyna, Manitius Jacek
Publikováno v:
Open Medicine, Vol 5, Iss 3, Pp 381-386 (2010)
Externí odkaz:
https://doaj.org/article/dc6840aa08c9454ba25bf74f4724800c
Autor:
Strozecki, Yann
This habilitation thesis is intended to be a good introduction to enumeration, the problem of listing solutions. It focuses on the different ways of measuring complexity in enumeration, with a particular emphasis on my contributions to the field.
Externí odkaz:
http://arxiv.org/abs/2309.17042
Autor:
Cabessa, Jérémie, Strozecki, Yann
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 weights, evolving weights, and real probabilities, respectively. First,
Externí odkaz:
http://arxiv.org/abs/2309.17032
Autor:
Capelli, Florent, Strozecki, Yann
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$ distinct solutions for any given $t$, then another relevant measure
Externí odkaz:
http://arxiv.org/abs/2108.10208
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 complexity bound, which implies and improves on the results of several arti
Externí odkaz:
http://arxiv.org/abs/2102.04922
Autor:
Guiraud, Maël, Strozecki, Yann
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 challenge, to fulfill protocol constraints, is to guarantee low latency f
Externí odkaz:
http://arxiv.org/abs/2002.07606
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
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 study the compatibility of such a technology with the development of the
Externí odkaz:
http://arxiv.org/abs/1902.03018
The best algorithm so far for solving Simple Stochastic Games is Ludwig's randomized algorithm which works in expected $2^{O(\sqrt{n})}$ time. We first give a simpler iterative variant of this algorithm, using Bland's rule from the simplex algorithm,
Externí odkaz:
http://arxiv.org/abs/1901.05316
Autor:
Capelli, Florent, Strozecki, Yann
Publikováno v:
Discrete Applied Mathematics, Volume 303, 2021, Pages 203-215
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 each model and not on the size of the formula, which can be exponentia
Externí odkaz:
http://arxiv.org/abs/1810.04006