Results 11 to 20 of about 99,580 (267)
Ratio-balanced maximum flows [PDF]
Information Processing Letters, 2019 When a loan is approved for a person or company, the bank is subject to \emph{credit risk}; the risk that the lender defaults. To mitigate this risk, a bank will require some form of \emph{security}, which will be collected if the lender defaults. Accounts can be secured by several securities and a security can be used for several accounts. The goal is
Hannaneh Akrami +2 more
openaire +4 more sources
A randomized maximum-flow algorithm [PDF]
30th Annual Symposium on Foundations of Computer Science, 1989 Summary: A randomized algorithm for computing a maximum flow is presented. For an \(n\)-vertex \(m\)-edge network, the running time is \(O(nm + n^2 (\log n)^2)\) with probability at least \(1 - 2^{- \sqrt {nm}}\). The algorithm is always correct, and in the worst case runs in \(O(nm \log n)\) time.
Cheriyan, J., Hagerup, T.
openaire +2 more sources
Factors determining maximum inspiratory flow and maximum expiratory flow of the lung [PDF]
Thorax, 1968 The factors determining maximum expiratory flow and maximum inspiratory flow of the lung are reviewed with particular reference to a model which compares the lung on forced expiration to a Starling resistor. The theoretical significance of the slope of the expiratory maximum flow-volume curve is discussed.
J, Jordanoglou, N B, Pride
openaire +2 more sources
Policy-Compliant Maximum Network Flows
Applied Sciences, 2019 Computer network administrators are often interested in the maximal bandwidth that can be achieved between two nodes in the network, or how many edges can fail before the network gets disconnected.
Pieter Audenaert +2 more
doaj +1 more source
Importance of maximum snow accumulation for summer low flows in humid catchments [PDF]
Hydrology and Earth System Sciences, 2016 Winter snow accumulation obviously has an effect on the following catchment runoff. The question is, however, how long this effect lasts and how important it is compared to rainfall inputs. Here we investigate the relative importance of snow accumulation
M. Jenicek +4 more
doaj +1 more source
THE SPATIO-TEMPORAL VARIABILITY OF MAXIMUM FLOW IN THE UZ HYDROGRAPHICAL BASIN [PDF]
Aerul şi Apa: Componente ale Mediului, 2016 The analysis of the maximum flow, resulting from the influences of several miscellaneous control factors, leads to the empirical knowledge of the quantitative and qualitative hydrological characteristics of the rivers.
I.D. MIFTODE +1 more
doaj +1 more source
Maximum Balanced Flow in a Network
Journal of Combinatorial Theory, Series B, 2000 A ``parity problem'' for a network flow is posed, and solved by reducing it to the \(b\)-matching problem in a graph. The result is claimed to be instrumental in some interesting cases of integer multiflow optimization; these applications are given in \textit{H. Ilani}, \textit{E. Korach} and \textit{M. Lomonosov} [J. Comb. Theory, Ser.
Hagai Ilani, Michael Lomonosov
openaire +1 more source
On multiroute maximum flows in networks [PDF]
Networks, 2001 AbstractLet G = (N, A) be a network with a designated source node s, a designated sink node t, and a finite integral capacity uij on each arc (i, j) ∈ A. An elementary K‐flow is a flow of K units from s to t such that the flow on each arcis 0 or 1. A K‐route flow is a flow from s to t that may be expressed as a nonnegative linear sum of elementary K ...
Charu C. Aggarwal, James B. Orlin
openaire +2 more sources
Long-Term Variability of Runoff of Vistula River in 1951-2015. [PDF]
Aerul şi Apa: Componente ale Mediului, 2019 This study presents the characteristics of the Vistula River runoff in the perspective of many years. Based on the daily values of Vistula flows for 9 selected hydrological stations located along the course of the river, analysis of the long-term ...
Katarzyna KUBIAK-WÓJCICKA
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