English
Related papers

Related papers: Picking up the Pieces: Self-Healing in Reconfigura…

200 papers

The inverse problem of finding the optimal network structure for a specific type of dynamical process stands out as one of the most challenging problems in network science. Focusing on the susceptible-infected-susceptible type of dynamics…

Physics and Society · Physics 2021-02-03 Liming Pan , Wei Wang , Lixin Tian , Ying-Cheng Lai

In many wireless networks, there is no fixed physical backbone nor centralized network management. The nodes of such a network have to self-organize in order to maintain a virtual backbone used to route messages. Moreover, any node of the…

Distributed, Parallel, and Cluster Computing · Computer Science 2014-08-12 François Delbot , Christian Laforest , Stephane Rovedakis

Security is one of the major issue in wired and wireless network but due to the presence of centralized administration not difficult to find out misbehavior in network other than in Mobile Ad hoc Network due to the absence of centralized…

Networking and Internet Architecture · Computer Science 2013-07-16 Gaurav Soni , Kamlesh Chandravanshi

In Nature, the primary goal of any network is to survive. This is less obvious for engineering networks (electric power, gas, water, transportation systems etc.) that are expected to operate under normal conditions most of time. As a…

Physics and Society · Physics 2020-10-02 Svetlana V. Poroseva

We consider networks of small, autonomous devices that communicate with each other wirelessly. Minimizing energy usage is an important consideration in designing algorithms for such networks, as battery life is a crucial and limited…

Data Structures and Algorithms · Computer Science 2022-04-19 Varsha Dani , Aayush Gupta , Thomas P. Hayes , Seth Pettie

We study budget constrained network upgradeable problems. We are given an undirected edge weighted graph $G=(V,E)$ where the weight an edge $e \in E$ can be upgraded for a cost $c(e)$. Given a budget $B$ for improvement, the goal is to find…

Data Structures and Algorithms · Computer Science 2014-12-12 Debjyoti Saharoy , Sandeep Sen

With increasingly ambitious initiatives such as GENI and FIND that seek to design the future Internet, it becomes imperative to define the characteristics of robust topologies, and build future networks optimized for robustness. This paper…

Networking and Internet Architecture · Computer Science 2009-09-25 Ali Sydney , Caterina Scoglio , Mina Youssef , Phillip Schumm

Networks are designed with functionality, security, performance, and cost in mind. Tools exist to check or optimize individual properties of a network. These properties may conflict, so it is not always possible to run these tools in series…

Cryptography and Security · Computer Science 2019-02-19 Timothy Curry , Devon Callahan , Benjamin Fuller , Laurent Michel

The goal of this note is to assess whether simple machine learning algorithms can be used to determine whether and how a given network has been attacked. The procedure is based on the $k$-Nearest Neighbor and the Random Forest…

Physics and Society · Physics 2023-08-30 Davide Coppes , Paolo Cermelli

Safety is a critical concern for the next generation of autonomy that is likely to rely heavily on deep neural networks for perception and control. Formally verifying the safety and robustness of well-trained DNNs and learning-enabled…

Machine Learning · Computer Science 2021-08-10 Xiaodong Yang , Tom Yamaguchi , Hoang-Dung Tran , Bardh Hoxha , Taylor T Johnson , Danil Prokhorov

We consider a network topology design problem in which an initial undirected graph underlying the network is given and the objective is to select a set of edges to add to the graph to optimize the coherence of the resulting network. We show…

Optimization and Control · Mathematics 2014-11-19 Tyler Summers , Iman Shames , John Lygeros , Florian Dörfler

A $t$-spanner of an undirected $n$-vertex graph $G$ is a sparse subgraph $H$ of $G$ that preserves all pairwise distances between its vertices to within multiplicative factor $t$, also called the \emph{stretch}. We investigate the problem…

Data Structures and Algorithms · Computer Science 2026-01-29 Julia Chuzhoy , Merav Parter

Decycling and dismantling of complex networks are underlying many important applications in network science. Recently these two closely related problems were tackled by several heuristic algorithms, simple and considerably sub-optimal, on…

Physics and Society · Physics 2019-02-18 Lenka Zdeborová , Pan Zhang , Hai-Jun Zhou

In this paper we consider a defending problem on a network. In the model, the defender holds a total defending resource of R, which can be distributed to the nodes of the network. The defending resource allocated to a node can be shared by…

Computer Science and Game Theory · Computer Science 2019-11-20 Minming Li , Long Tran-Thanh , Xiaowei Wu

Graph reconstruction can efficiently detect the underlying topology of massive networks such as the Internet. Given a query oracle and a set of nodes, the goal is to obtain the edge set by performing as few queries as possible. An algorithm…

Data Structures and Algorithms · Computer Science 2024-07-29 Clara Stegehuis , Lotte Weedage

The heterogeneous structure implies that a very few nodes may play the critical role in maintaining structural and functional properties of a large-scale network. Identifying these vital nodes is one of the most important tasks in network…

Physics and Society · Physics 2020-02-14 Yong Yu , Ming Jing , Na Zhao , Tao Zhou

Despite dropout's ubiquity in machine learning, its effectiveness as a form of data augmentation remains under-explored. We address two key questions: (i) When is dropout effective as an augmentation strategy? (ii) Is dropout uniquely…

Machine Learning · Computer Science 2025-06-02 Rickard Brüel-Gabrielsson , Tongzhou Wang , Manel Baradad , Justin Solomon

The ever increasing utilization of sensitive loads in the industrial, commercial and residential areas in distribution networks requires enhanced reliability and quality of supply. This can be achieved thanks to self healing features of…

Optimization and Control · Mathematics 2018-04-18 Hossein Sekhavatmanesh , Rachid Cherkaoui

Graph neural networks (GNNs) excel on homophilic graphs where connected nodes share labels, but struggle with heterophilic graphs where edges do not imply similarity. Moreover, iterative message passing limits scalability due to…

Machine Learning · Computer Science 2026-02-16 Turja Kundu , Sanjukta Bhowmick

The limited and dynamically varied resources on edge devices motivate us to deploy an optimized deep neural network that can adapt its sub-networks to fit in different resource constraints. However, existing works often build sub-networks…

Computer Vision and Pattern Recognition · Computer Science 2022-07-05 Zhongnan Qu , Syed Shakib Sarwar , Xin Dong , Yuecheng Li , Ekin Sumbul , Barbara De Salvo
‹ Prev 1 8 9 10 Next ›