Zobrazeno 1 - 10
of 83
pro vyhledávání: '"Francesco Scarcello"'
Autor:
Danilo Avola, Luigi Cinque, Angelo Di Mambro, Romeo Lanzino, Daniele Pannone, Francesco Scarcello
Publikováno v:
IEEE Access, Vol 12, Pp 83940-83951 (2024)
Determining the motor intentions of an individual through the analysis of electroencephalograms (EEGs) is a challenging task that concurrently holds considerable potential in aiding subjects with motor dysfunctions. Moreover, thanks to the recent adv
Externí odkaz:
https://doaj.org/article/c5f115e4e72a4b63b60a95dc1ff7c50f
Autor:
Danilo Avola, Luigi Cinque, Gian Luca Foresti, Romeo Lanzino, Marco Raoul Marini, Alessio Mecca, Francesco Scarcello
Publikováno v:
Sensors, Vol 23, Iss 5, p 2655 (2023)
During flight, unmanned aerial vehicles (UAVs) need several sensors to follow a predefined path and reach a specific destination. To this aim, they generally exploit an inertial measurement unit (IMU) for pose estimation. Usually, in the UAV context,
Externí odkaz:
https://doaj.org/article/dc078261017f449f9b130aa2410c2219
Autor:
Francesco Scarcello
Publikováno v:
When AIAA Meets IEEE ISBN: 9789811983931
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e0a0583ce8f93c3c876bb82be2fbbed3
https://doi.org/10.1007/978-981-19-8394-8_2
https://doi.org/10.1007/978-981-19-8394-8_2
Autor:
Francesco Scarcello, Gianluigi Greco
Publikováno v:
AAAI
Maximin share is a compelling notion of fairness proposed by Buddish as a relaxation of more traditional concepts for fair allocations of indivisible goods. In this paper we consider this notion within a setting where bundles of goods must induce con
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2d0dbf4ea945bb86dc95af8afee51fb3
https://doi.org/10.1609/aaai.v34i02.5572
https://doi.org/10.1609/aaai.v34i02.5572
Publikováno v:
Intelligenza Artificiale. 14:179-181
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::39eefeca3de613426315bdc6682bbf49
https://doi.org/10.3233/ia-200072
https://doi.org/10.3233/ia-200072
Autor:
Gianluigi Greco, Francesco Scarcello
Publikováno v:
SIAM Journal on Computing. 46:1111-1145
Answering conjunctive queries is a fundamental problem in database theory, and it is equivalent to solving constraint satisfaction problems in artificial intelligence and to other fundamental problems arising in computer science, which can be recast
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fa2ade66b1923cd60ec19c5ffdcdfeb7
https://doi.org/10.1137/16m1090272
https://doi.org/10.1137/16m1090272
This book constitutes the proceedings of the XVIIIth International Conference of the Italian Association for Artificial Intelligence, AI•IA 2019, held in Rende, Italy, in November 2019. The 41 full papers were carefully reviewed and selected from 6
Publikováno v:
Artificial Intelligence. 278:103180
The paper focuses on cooperative games where the worth of any coalition of agents is determined by the optimal value of a matching problem on (possibly weighted) graphs. These games come in different forms that can be grouped in two broad classes, na
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7f969f46916fe5d4af7c04a3f1aeac44
https://doi.org/10.1016/j.artint.2019.103180
https://doi.org/10.1016/j.artint.2019.103180
Publikováno v:
ACM Transactions on Computation Theory. 7:1-52
The nucleolus is a well-known solution concept for coalitional games to fairly distribute the total available worth among the players. The nucleolus is known to be NP -hard to compute over compact coalitional games, that is, over games whose function
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3dbce33fb753737ca6df5f2e1665ace9
https://doi.org/10.1145/2692372.2692374
https://doi.org/10.1145/2692372.2692374
Publikováno v:
Journal of Computer and System Sciences. 94
Tree projections provide a unifying framework to deal with most structural decomposition methods of constraint satisfaction problems (CSPs). Within this framework, a CSP instance is decomposed into a number of sub-problems, called views, whose soluti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3dc67dcc1d2b47bad010892236d7f3f2
http://ora.ox.ac.uk/objects/uuid:
http://ora.ox.ac.uk/objects/uuid: