Viviana Arrigoni
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Viviana Arrigoni has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Novella Bartolini
Computer Science Department, Sapienza University of Rome, Rome, Italy
8 shared publications - Annalisa Massini
Department of Computer Science, Sapienza University of Rome, Rome, Italy
3 shared publications - Giulio Attenni
Computer Science Department, Sapienza University of Rome, Rome, Italy
3 shared publications - Matteo Prata
Department of Computer Science, Sapienza University of Rome, Rome, Italy
2 shared publications - Andrea Coletta
Banca d'Italia, Roma, Italy
1 shared publication Federico Trombetti
Department of Computer Science, Sapienza University of Rome, Rome, Italy
1 shared publication
Latest Publications
- Open Access
- 4 January 2026
- Published by Association for Computing Machinery (ACM)
- p. 34-35
Adaptive Strategies For Reducing The Carbon Footprint of Deep Neural Networks
- 4 January 2026
- Published by Association for Computing Machinery (ACM)
- p. 34-35
Open AccessAdaptive Strategies For Reducing The Carbon Footprint of Deep Neural Networks
- Open Access
- 4 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 75 (6) , 9144-9156
Scheduling UAV-Based Deliveries With an Approximation Algorithm
The need for environmentally conscious alternatives to traditional road transport is progressively growing as digital marketplaces continue to integrate more deeply into our daily lives. Employing drones for parcel delivery is a possible solution to mitigating road traffic and pollution. Nevertheless, designing an efficient drone delivery system comes with numerous challenges, including planning efficient scheduling of delivery tasks and coping with the strong impact that weather conditions have on drones' mobility. We consider a drone delivery service based on a distributed infrastructure of service stations that a fleet of drones can use for battery replacement, allowing long-distance deliveries. We formulate the problem of scheduling the drone fleet's operations so as to minimize the completion time of the delivery tasks and propose an approximation algorithm called REDMAT. Our algorithm enables a straightforward extension to consider real-time demands and variable wind conditions, based on a thorough mathematical model, and that we simulate in our experiments. We simulate our solutions under numerous experimental settings, including dynamic scenarios with online delivery demand arrivals, and variable wind conditions, and compare the achieved performance against other existing solutions. Our experiments show the superior efficiency of our algorithm, which provides a remarkable improvement in the makespan (i.e., the maximum delivery time) and average delivery completion time, respectively up to 40% and up to 24.5% with respect to the state-of-the-art solutions.
- 4 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 75 (6) , 9144-9156
Open AccessScheduling UAV-Based Deliveries With an Approximation Algorithm
The need for environmentally conscious alternatives to traditional road transport is progressively growing as digital marketplaces continue to integrate more deeply into our daily lives. Employing drones for parcel delivery is a possible solution to mitigating road traffic and pollution. Nevertheless, designing an efficient drone delivery system comes with numerous challenges, including planning efficient scheduling of delivery tasks and coping with the strong impact that weather conditions have on drones' mobility. We consider a drone delivery service based on a distributed infrastructure of service stations that a fleet of drones can use for battery replacement, allowing long-distance deliveries. We formulate the problem of scheduling the drone fleet's operations so as to minimize the completion time of the delivery tasks and propose an approximation algorithm called REDMAT. Our algorithm enables a straightforward extension to consider real-time demands and variable wind conditions, based on a thorough mathematical model, and that we simulate in our experiments. We simulate our solutions under numerous experimental settings, including dynamic scenarios with online delivery demand arrivals, and variable wind conditions, and compare the achieved performance against other existing solutions. Our experiments show the superior efficiency of our algorithm, which provides a remarkable improvement in the makespan (i.e., the maximum delivery time) and average delivery completion time, respectively up to 40% and up to 24.5% with respect to the state-of-the-art solutions.
- Open Access
- 12 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 32 (6) , 5216-5231
Recovering Critical Service After Large-Scale Failures With Bayesian Network Tomography
Massive failures in communication networks result from natural disasters, heavy blackouts, and military and cyber attacks. After these events, an adequate network recovery plan is key to ensuring emergency-critical service restoration and preventing intolerable downtime and performance degradation. We tackle the problem of minimizing the time and number of interventions to sufficiently restore the communication network to support emergency services after large-scale failures. We propose (Progressive RecOvery and Tomography-based mONitoring), an efficient algorithm for progressive recovery of emergency services. Unlike previous work, assuming centralized routing and complete network observability, addresses the more realistic scenario in which the network relies on the existing routing protocols, and knowledge of the network state is partial and uncertain. relies on Network Tomography for monitoring and acquiring information about the state of nodes and links. Simulation results on real topologies show that our algorithm outperforms previous solutions in terms of cumulative routed flow, repair costs and recovery time in static and dynamic failure scenarios.
- 12 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 32 (6) , 5216-5231
Open AccessRecovering Critical Service After Large-Scale Failures With Bayesian Network Tomography
Massive failures in communication networks result from natural disasters, heavy blackouts, and military and cyber attacks. After these events, an adequate network recovery plan is key to ensuring emergency-critical service restoration and preventing intolerable downtime and performance degradation. We tackle the problem of minimizing the time and number of interventions to sufficiently restore the communication network to support emergency services after large-scale failures. We propose (Progressive RecOvery and Tomography-based mONitoring), an efficient algorithm for progressive recovery of emergency services. Unlike previous work, assuming centralized routing and complete network observability, addresses the more realistic scenario in which the network relies on the existing routing protocols, and knowledge of the network state is partial and uncertain. relies on Network Tomography for monitoring and acquiring information about the state of nodes and links. Simulation results on real topologies show that our algorithm outperforms previous solutions in terms of cumulative routed flow, repair costs and recovery time in static and dynamic failure scenarios.
- Open Access
- 13 April 2024
- Published by Springer Nature in Artificial Intelligence Review
- Vol. 57 (5) , 1-45
Lob-based deep learning models for stock price trend prediction: a benchmark study
The recent advancements in Deep Learning (DL) research have notably influenced the finance sector. We examine the robustness and generalizability of fifteen state-of-the-art DL models focusing on Stock Price Trend Prediction (SPTP) based on Limit Order Book (LOB) data. To carry out this study, we developed LOBCAST, an open-source framework that incorporates data preprocessing, DL model training, evaluation, and profit analysis. Our extensive experiments reveal that all models exhibit a significant performance drop when exposed to new data, thereby raising questions about their real-world market applicability. Our work serves as a benchmark, illuminating the potential and the limitations of current approaches and providing insight for innovative solutions.
- 13 April 2024
- Published by Springer Nature in Artificial Intelligence Review
- Vol. 57 (5) , 1-45
Open AccessLob-based deep learning models for stock price trend prediction: a benchmark study
The recent advancements in Deep Learning (DL) research have notably influenced the finance sector. We examine the robustness and generalizability of fifteen state-of-the-art DL models focusing on Stock Price Trend Prediction (SPTP) based on Limit Order Book (LOB) data. To carry out this study, we developed LOBCAST, an open-source framework that incorporates data preprocessing, DL model training, evaluation, and profit analysis. Our extensive experiments reveal that all models exhibit a significant performance drop when exposed to new data, thereby raising questions about their real-world market applicability. Our work serves as a benchmark, illuminating the potential and the limitations of current approaches and providing insight for innovative solutions.
- Open Access
- 3 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 123476-123504
Drone-Based Delivery Systems: A Survey on Route Planning
The ever-increasing demand for urban delivery services significantly exacerbates the traffic conditions on our already overly congested urban streets. The problem is even worsened by the dearth of appropriate parking facilities available for efficient offloading operations. As a result, there has been a surge of interest in exploring eco-friendly alternatives to traditional truck-based logistics. Drone technology has significant potential to enable widespread home delivery services and reduce the reliance on trucks within urban areas. Both the academy and the industry have shown interest in developing swiftly deployable and cost-effective delivery systems that rely on drones. This work provides a comprehensive review of the current state of Drone-based Delivery Systems. It explores the latest advancements, methodologies, and employed techniques with a specific emphasis on optimizing task scheduling and designing efficient routes for drone deliveries. It critically analyzes the advantages and drawbacks of existing solutions, contributing a thorough classification based on crucial system features, such as fleet composition, degree of device cooperation, and underlying infrastructure.
- 3 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 123476-123504
Open AccessDrone-Based Delivery Systems: A Survey on Route Planning
The ever-increasing demand for urban delivery services significantly exacerbates the traffic conditions on our already overly congested urban streets. The problem is even worsened by the dearth of appropriate parking facilities available for efficient offloading operations. As a result, there has been a surge of interest in exploring eco-friendly alternatives to traditional truck-based logistics. Drone technology has significant potential to enable widespread home delivery services and reduce the reliance on trucks within urban areas. Both the academy and the industry have shown interest in developing swiftly deployable and cost-effective delivery systems that rely on drones. This work provides a comprehensive review of the current state of Drone-based Delivery Systems. It explores the latest advancements, methodologies, and employed techniques with a specific emphasis on optimizing task scheduling and designing efficient routes for drone deliveries. It critically analyzes the advantages and drawbacks of existing solutions, contributing a thorough classification based on crucial system features, such as fleet composition, degree of device cooperation, and underlying infrastructure.
- Open Access
- 2 September 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 31 (2) , 770-783
A Bayesian Approach to Network Monitoring for Progressive Failure Localization
Boolean Network Tomography (BNT) aims at identifying failures of internal network components by means of end-to-end monitoring paths. However, when the number of failures is not known a priori, failure identification may require a huge number of monitoring paths. We address this problem by designing a Bayesian approach that progressively selects the next path to probe on the basis of its expected information utility, conditioned on prior observations. As the complexity of the computation of posterior probabilities of node failures is exponential in the number of failed paths, we propose a polynomial-time greedy strategy which approximates these values. To consider aging of information in dynamic failure scenarios where node states can change during a monitoring period, we propose a monitoring technique based on a sliding observation window of adaptive length. By means of numerical experiments conducted on real network topologies we demonstrate the practical applicability of our approach, and the superiority of our algorithms with respect to state of the art solutions based on classic BNT as well as sequential group testing.
- 2 September 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 31 (2) , 770-783
Open AccessA Bayesian Approach to Network Monitoring for Progressive Failure Localization
Boolean Network Tomography (BNT) aims at identifying failures of internal network components by means of end-to-end monitoring paths. However, when the number of failures is not known a priori, failure identification may require a huge number of monitoring paths. We address this problem by designing a Bayesian approach that progressively selects the next path to probe on the basis of its expected information utility, conditioned on prior observations. As the complexity of the computation of posterior probabilities of node failures is exponential in the number of failed paths, we propose a polynomial-time greedy strategy which approximates these values. To consider aging of information in dynamic failure scenarios where node states can change during a monitoring period, we propose a monitoring technique based on a sliding observation window of adaptive length. By means of numerical experiments conducted on real network topologies we demonstrate the practical applicability of our approach, and the superiority of our algorithms with respect to state of the art solutions based on classic BNT as well as sequential group testing.
- Open Access
- 18 August 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Networking Letters
- Vol. 4 (4) , 199-203
Network Identifiability: Advances in Separating Systems and Networking Applications
This letter discusses the parallelism between the concept of network identifiability introduced by Boolean Network Tomography (BNT), and the theory of separating systems, highlighting applications of interest to research in networking. This letter evidences how recent results of BNT have direct implications to the formulation of new bounds to the size of separating systems over finite sets. Grounding on these theoretical results, we provide an efficient algorithm for the design of separating systems that meet the bound tightly. We extend the proposed results, bounds and algorithm, to networking applications, including network failure assessment, robust network design and compressed sensing.
- 18 August 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Networking Letters
- Vol. 4 (4) , 199-203
Open AccessNetwork Identifiability: Advances in Separating Systems and Networking Applications
This letter discusses the parallelism between the concept of network identifiability introduced by Boolean Network Tomography (BNT), and the theory of separating systems, highlighting applications of interest to research in networking. This letter evidences how recent results of BNT have direct implications to the formulation of new bounds to the size of separating systems over finite sets. Grounding on these theoretical results, we provide an efficient algorithm for the design of separating systems that meet the bound tightly. We extend the proposed results, bounds and algorithm, to networking applications, including network failure assessment, robust network design and compressed sensing.
- Open Access
- 1 January 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 6076-6086
Topology Agnostic Bounds on Minimum Requirements for Network Failure Identification
In Boolean Network Tomography (BNT), node identifiability is a crucial property that reflects the possibility of unambiguously classifying the state of the nodes of a network as 'working' or 'failed' through end-to-end measurement paths. Designing a monitoring scheme satisfying network identifiability is an NP problem. In this article, we provide theoretical bounds on the minimum number of necessary measurement paths to guarantee identifiability of a given number of nodes. The bounds take into consideration two different classes of routing schemes (arbitrary and consistent routing) as well as quality of service (QoS) requirements. We formally prove the tightness of such bounds for the arbitrary routing scheme, and provide an algorithmic approach to the design of network topologies and path deployment that meet the discussed limits. Due to the computational complexity of the optimal solution, We evaluate the tightness of our lower bounds by comparing their values with an upper bound, obtained by a state-of-the-art heuristic for node identifiability. For our experiments we run extensive simulations on both synthetic and real network topologies, for which we show that the two bounds are close to each other, despite the fact that the provided lower bounds are topology agnostic.
- 1 January 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 6076-6086
Open AccessTopology Agnostic Bounds on Minimum Requirements for Network Failure Identification
In Boolean Network Tomography (BNT), node identifiability is a crucial property that reflects the possibility of unambiguously classifying the state of the nodes of a network as 'working' or 'failed' through end-to-end measurement paths. Designing a monitoring scheme satisfying network identifiability is an NP problem. In this article, we provide theoretical bounds on the minimum number of necessary measurement paths to guarantee identifiability of a given number of nodes. The bounds take into consideration two different classes of routing schemes (arbitrary and consistent routing) as well as quality of service (QoS) requirements. We formally prove the tightness of such bounds for the arbitrary routing scheme, and provide an algorithmic approach to the design of network topologies and path deployment that meet the discussed limits. Due to the computational complexity of the optimal solution, We evaluate the tightness of our lower bounds by comparing their values with an upper bound, obtained by a state-of-the-art heuristic for node identifiability. For our experiments we run extensive simulations on both synthetic and real network topologies, for which we show that the two bounds are close to each other, despite the fact that the provided lower bounds are topology agnostic.
- 19 March 2020
- Published by Springer Nature
- p. 129-140
Hybrid Solver for Quasi Block Diagonal Linear Systems
- 19 March 2020
- Published by Springer Nature
- p. 129-140
Hybrid Solver for Quasi Block Diagonal Linear Systems