12 papers · ranked by Valyu relevance
Ahmed A. Zaki Diab, Ashraf M. Abdelhamid, Hamdy M. Sultan
This paper provides six metaheuristic algorithms, namely Fast Cuckoo Search (FCS), Salp Swarm Algorithm (SSA), Dynamic control Cuckoo search (DCCS), Gradient-Based Optimizer (GBO), Northern Goshawk Optimization (NGO), Opposition Flow Direction Algorithm (OFDA) to efficiently solve the optimal power flow (OPF) issue.…
Arsineh Boodaghian Asl, Jayanth Raghothama, Adam S. Darwich, Sebastiaan Meijer
'Sebastiaan Meijer'] Hospitals are complex systems, and the flow of patients is dynamic and nonlinear in such systems. Network representation allows flow algorithms to observe bottlenecks as candidates for optimisation. To model the dynamic behaviour of the patient flow, we need to consider the variability in arrival…
Jiaxin Jiang, Yunxiang Zhao, Lyu Xu, Byron Choi + 3 more
—Transaction flow networks are crucial in detecting illicit activities such as wash trading, credit card fraud, cashback arbitrage fraud, and money laundering. Our collaborator, Grab, a leader in digital payments in Southeast Asia, faces increasingly sophisticated fraud patterns in its transaction flow networks. In…
Zengkai Wang, Weizhi Liao, Xiaoyun Xia, Zijia Wang + 3 more
'Heming Jia' 'Xuewen Xia'] Routing and scheduling in Time-Sensitive Networking (TSN) is an NP-hard problem. In this paper, we propose a novel routing and scheduling approach for TSN based on evolutionary algorithm. Specifically, we introduce a flow grouping method that leverages the greatest common divisor to optimize…
Juntong Luo, Scott Sallinen, Matei Ripeanu
—Recent advances in dynamic graph processing have enabled the analysis of highly dynamic graphs with change at rates as high as millions of edge changes per second. Solutions in this domain, however, have been demonstrated only for relatively simple algorithms like PageRank, breadth-first search, and connected…
Gramoz Goranci, Monika Henzinger
The maximum flow problem is one of the cornerstone and the most studied problem in combinatorial optimization. It is often used as subroutine for solving other prominent graph problems (e.g., Gomory-Hu Trees [8], Sparsest Cut [17]), performing divide-and-conquer on graphs and has found several applications across many…
Shruthi Kannappan, Ashwina Kumar, Rupesh Nasre
MaxFlow is a fundamental problem in graph theory and combinatorial optimisation, used to determine the maximum flow from a source node to a sink node in a flow network. It finds applications in diverse domains, including computer networks, transportation, and image segmentation. The core idea is to maximise the total…
Simon Meierhans, Maximilian Probst Gutenberg, Thatchaphol Saranurak
Expander graphs are known to be robust to edge deletions in the following sense: for any online sequence of edge deletions e1, e2, . . . , ek to an m-edge graph G that is initially a ϕexpander, the algorithm can grow a set P ⊆ V such that at any time t, G[V \ P] is an expander of the same quality as the initial graph G…
Krishneel Deo, Kaylash Chaudhary, Mansour Assaf, Ahyoung Lee
Quality of Service (QoS) is a mechanism used in computer networks to prioritize, classify, and treat packets differently based on certain criteria. This helps the switching devices to schedule and reorder packets if there is congestion in the network. Edge routers experience high traffic congestion as a result of…
Shahbaz Khan, Milla Kortelainen, Manuel Cáceres, Lucia Williams + 1 more
'Alexandru I. Tomescu'] Decomposing a network flow into weighted paths is a problem with numerous applications, ranging from networking, transportation planning, to bioinformatics. In some applications we look for a decomposition that is optimal with respect to some property, such as the number of paths used…
Simon Scherrer, Jo Vliegen, Arish Sateesan, Hsu‐Chun Hsiao + 2 more
'Nele Mentens' 'Adrian Perrig'] Abstract—Modern DDoS defense systems rely on probabilistic monitoring algorithms to identify flows that exceed a volume threshold and should thus be penalized. Commonly, classic sketch algorithms are considered sufficiently accurate for usage in DDoS defense. However, as we show in this…
Man Tianxing, Mikhail Lushnov, Dmitry I. Ignatov, Yulia Alexandrovna Shichkina + 3 more
Researchers working in various domains are focusing on extracting information from data sets by data mining techniques. However, data mining is a complicated task, including multiple complex processes, so that it is unfriendly to non-computer researchers. Due to the lack of experience, they cannot design suitable…