Zobrazeno 1 - 10
of 882
pro vyhledávání: '"d'Amore, Francesco A."'
Autor:
Balliu, Alkida, Brandt, Sebastian, Coiteux-Roy, Xavier, d'Amore, Francesco, Equi, Massimo, Gall, François Le, Lievonen, Henrik, Modanese, Augusto, Olivetti, Dennis, Renou, Marc-Olivier, Suomela, Jukka, Tendick, Lucas, Veeren, Isadora
We present the first local problem that shows a super-constant separation between the classical randomized LOCAL model of distributed computing and its quantum counterpart. By prior work, such a separation was known only for an artificial graph probl
Externí odkaz:
http://arxiv.org/abs/2411.03240
Autor:
Akbari, Amirreza, Coiteux-Roy, Xavier, d'Amore, Francesco, Gall, François Le, Lievonen, Henrik, Melnyk, Darya, Modanese, Augusto, Pai, Shreyas, Renou, Marc-Olivier, Rozhoň, Václav, Suomela, Jukka
We connect three distinct lines of research that have recently explored extensions of the classical LOCAL model of distributed computing: A. distributed quantum computing and non-signaling distributions [e.g. STOC 2024], B. finitely-dependent process
Externí odkaz:
http://arxiv.org/abs/2403.01903
The Strong Lottery Ticket Hypothesis (SLTH) states that randomly-initialised neural networks likely contain subnetworks that perform well without any training. Although unstructured pruning has been extensively studied in this context, its structured
Externí odkaz:
http://arxiv.org/abs/2311.09858
Autor:
Coiteux-Roy, Xavier, d'Amore, Francesco, Gajjala, Rishikesh, Kuhn, Fabian, Gall, François Le, Lievonen, Henrik, Modanese, Augusto, Renou, Marc-Olivier, Schmid, Gustav, Suomela, Jukka
We give an almost complete characterization of the hardness of $c$-coloring $\chi$-chromatic graphs with distributed algorithms, for a wide range of models of distributed computing. In particular, we show that these problems do not admit any distribu
Externí odkaz:
http://arxiv.org/abs/2307.09444
One of the cornerstones of the distributed complexity theory is the derandomization result by Chang, Kopelowitz, and Pettie [FOCS 2016]: any randomized LOCAL algorithm that solves a locally checkable labeling problem (LCL) can be derandomized with at
Externí odkaz:
http://arxiv.org/abs/2305.07351
Autor:
Becchetti, Luca, da Cunha, Arthur Carvalho Walraven, Clementi, Andrea, d'Amore, Francesco, Lesfari, Hicham, Natale, Emanuele, Trevisan, Luca
In the Random Subset Sum Problem, given $n$ i.i.d. random variables $X_1, ..., X_n$, we wish to approximate any point $z \in [-1,1]$ as the sum of a suitable subset $X_{i_1(z)}, ..., X_{i_s(z)}$ of them, up to error $\varepsilon$. Despite its simple
Externí odkaz:
http://arxiv.org/abs/2207.13944
Autor:
da Cunha, Arthur, d'Amore, Francesco, Giroire, Frédéric, Lesfari, Hicham, Natale, Emanuele, Viennot, Laurent
The average properties of the well-known Subset Sum Problem can be studied by the means of its randomised version, where we are given a target value $z$, random variables $X_1, \ldots, X_n$, and an error parameter $\varepsilon > 0$, and we seek a sub
Externí odkaz:
http://arxiv.org/abs/2204.13929
Autor:
Bencardino, Mariantonia, D’Amore, Francesco, Angot, Hélène, Angiuli, Lorenzo, Bertrand, Yann, Cairns, Warren, Diéguez, María C., Dommergue, Aurélien, Ebinghaus, Ralf, Esposito, Giulio, Komínková, Kateřina, Labuschagne, Casper, Mannarino, Valentino, Martin, Lynwill, Martino, Maria, Neves, Luis Mendes, Mashyanov, Nikolay, Magand, Olivier, Nelson, Peter, Norstrom, Claus, Read, Katie, Sholupov, Sergey, Skov, Henrik, Tassone, Antonella, Vítková, Gabriela, Cinnirella, Sergio, Sprovieri, Francesca, Pirrone, Nicola
Publikováno v:
In Environmental Pollution 15 December 2024 363 Part 2
Autor:
d'Amore, Francesco, Mitropolsky, Daniel, Crescenzi, Pierluigi, Natale, Emanuele, Papadimitriou, Christos H.
We revisit the planning problem in the blocks world, and we implement a known heuristic for this task. Importantly, our implementation is biologically plausible, in the sense that it is carried out exclusively through the spiking of neurons. Even tho
Externí odkaz:
http://arxiv.org/abs/2112.08186
Autor:
d'Amore, Francesco, Ziccardi, Isabella
Communication noise is a common feature in several real-world scenarios where systems of agents need to communicate in order to pursue some collective task. In particular, many biologically inspired systems that try to achieve agreements on some opin
Externí odkaz:
http://arxiv.org/abs/2112.03543