Results 51 to 60 of about 753,553 (169)
Research on Flow Sampling Algorithm Based on Counting Bloom Filter [PDF]
Jisuanji gongcheng, 2018 In order to adapt to the high-speed network environment and realize the accurate measurement of network traffic,a network algorithm of flow equal probability sampling based on the combination of Counting Bloom Filter and packet-based flow sampling ...
ZHAI Jinfeng,SUN Libo,LU Kai,LIN Xueyong,QIN Wenhu
doaj +1 more source
A bit-capacity scaling algorithm for the constrained minimal cost network flow problem [PDF]
Network Biology, 2021 A polynomial time algorithm for solving the minimum-cost network flow problem has been proposed in this paper. This algorithm is mainly based on the binary representation of capacities; it solves the minimum-cost flow problem in directed graph of n nodes
Muhammad Tlas
doaj
INFORMATION FLOWS IN CAUSAL NETWORKS [PDF]
Advances in Complex Systems, 2008 We use a notion of causal independence based on intervention, which is a fundamental concept of the theory of causal networks, to define a measure for the strength of a causal effect. We call this measure "information flow" and compare it with known information flow measures such as transfer entropy.
NIHAT AY, DANIEL POLANI
openaire +2 more sources
On the Duality Between Network Flows and Network Lasso [PDF]
IEEE Signal Processing Letters, 2020 Many applications generate data with an intrinsic network structure such as time series data, image data or social network data. The network Lasso (nLasso) has been proposed recently as a method for joint clustering and optimization of machine learning models for networked data.
openaire +2 more sources
Minimum Link Flow Problem and Its Solution With Sparse Modeling
IEEE AccessRecently, a statistical modeling approach called sparse modeling has attracted much attention, especially in the fields of signal and image processing.
Ryotaro Matsuo +2 more
doaj +1 more source
MathematicsNetwork flow task management involves the efficient allocation and scheduling of data flow tasks within dynamic satellite networks, aiming to effectively address frequent changes in network topology and dynamic traffic fluctuations.
Shangpeng Wang +4 more
doaj +1 more source
Graph-based strategies for optimising wildfire suppression
Journal of Physics: ComplexityWe present an algorithm for wildfire suppression based on graph theory that builds on realistic simulations of the propagation, is efficient, produces results in a short time, and has the potential to help achieve a faster suppression of a real fire. The
J Aveiro +7 more
doaj +1 more source
The maximum flow in dynamic networks [PDF]
Computer Science Journal of Moldova, 2005 The dynamic maximum flow problem that generalizes the static maximum flow problem is formulated and studied. We consider the problem on a network with capacities depending on time, fixed transit times on the arcs, and a given time horizon.
Maria A. Fonoberova, Dmitrii D. Lozovanu
doaj
Network Flow Classification Methodrule-Based
Journal of Harbin University of Science and Technology, 2017 In this paper，repeated incremental pruning to produce error reduction which is a rule learning ethod is used to solve network traffic classification. The method can be used to dig out the correlations between ttributes and classes，which are utilized to ...
CAO Yan-zhen +3 more
doaj +1 more source
ON NETWORK FLOW PROBLEMS WITH CONVEX COST
Journal of ICT, 2004 Minimum cost flow (MCF) problem is a typical example of network flow problems, for which an additional constraint of cost is added to each flow. Conventional MCF problems consider the cost constraints as linear functions of flow. In this paper, we extend
V. A. Nguyen, Y. P. Tan
doaj