Zobrazeno 1 - 10
of 21
pro vyhledávání: '"Favorito, Marco"'
Autor:
Benedetti, Marco, De Sclavis, Francesco, Favorito, Marco, Galano, Giuseppe, Giammusso, Sara, Muci, Antonio, Nardelli, Matteo
We introduce a family of PCNs (Payment Channel Networks) characterized by a semi-hierarchical topology and a custom set of channel rebalancing strategies. This family exhibits two interesting benefits, if used as a platform for large-scale, instant,
Externí odkaz:
http://arxiv.org/abs/2401.11868
Recent years witnessed a rising interest towards Datalog-based ontological reasoning systems, both in academia and industry. These systems adopt languages, often shared under the collective name of Datalog$+/-$, that extend Datalog with the essential
Externí odkaz:
http://arxiv.org/abs/2311.12236
One major limitation to the applicability of Reinforcement Learning (RL) to many practical domains is the large number of samples required to learn an optimal policy. To address this problem and improve learning efficiency, we consider a linear hiera
Externí odkaz:
http://arxiv.org/abs/2303.00516
Autor:
Favorito, Marco
This paper proposes a new AND-OR graph search framework for synthesis of Linear Temporal Logic on finite traces (\LTLf), that overcomes some limitations of previous approaches. Within such framework, we devise a procedure inspired by the Davis-Putnam
Externí odkaz:
http://arxiv.org/abs/2302.13825
Calibrating agent-based models (ABMs) in economics and finance typically involves a derivative-free search in a very large parameter space. In this work, we benchmark a number of search methods in the calibration of a well-known macroeconomic ABM on
Externí odkaz:
http://arxiv.org/abs/2302.11835
Autor:
Benedetti, Marco, De Sclavis, Francesco, Favorito, Marco, Galano, Giuseppe, Giammusso, Sara, Muci, Antonio, Nardelli, Matteo
Distributed Ledger Technologies (DLTs), when managed by a few trusted validators, require most but not all of the machinery available in public DLTs. In this work, we explore one possible way to profit from this state of affairs. We devise a combinat
Externí odkaz:
http://arxiv.org/abs/2207.06870
We study temporally extended goals expressed in Pure-Past LTL (PPLTL). PPLTL is particularly interesting for expressing goals since it allows to express sophisticated tasks as in the Formal Methods literature, while the worst-case computational compl
Externí odkaz:
http://arxiv.org/abs/2204.09960
Datalog^E is the extension of Datalog with existential quantification. While its high expressive power, underpinned by a simple syntax and the support for full recursion, renders it particularly suitable for modern applications on knowledge graphs, q
Externí odkaz:
http://arxiv.org/abs/2202.06285
Autor:
Favorito, Marco
The heterogeneity of tools that support temporal logic formulae poses several challenges in terms of interoperability. In particular, a standard syntax for temporal logic on finite traces, despite similar to the one for infinite traces, is currently
Externí odkaz:
http://arxiv.org/abs/2012.13638
Publikováno v:
In Computers in Industry August 2023 149