Results 71 to 80 of about 119,914 (208)
Maximum Flows in Parametric Graph Templates
, 2023 Execution graphs of parallel loop programs exhibit a nested, repeating structure. We show how such graphs that are the result of nested repetition can be represented by succinct parametric structures. This parametric graph template representation allows us to reason about the execution graph of a parallel program at a cost that only depends on the ...
Tal Ben-Nun +3 more
openaire +3 more sources
Journal of Hydrology: Regional Studies, 2020 Study region: Kaleya River Catchment in southern Zambia. Study focus: The ability of a landscape hydrology approach to detect controls on water availability in a fragmented landscape to inform interventions under a changing environment was investigated ...
Moses N. Chisola +2 more
doaj +1 more source
Playing with the Maximum-Flow Problem
EPiC Series in Computing, 2018 In the traditional maximum-flow problem, the goal is to transfer maximum flow in a network by directing, in each vertex in the network, incoming flow into outgoing edges. The problem has been extensively used in order to optimize the performance of networks in numerous application areas.
openaire +2 more sources
On the history of the transportation and maximum flow problems [PDF]
Mathematical Programming, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +4 more sources
Speeding Up the Estimation of Expected Maximum Flows Through Reliable Networks [PDF]
In this paper we present a strategy for speeding up the estimation of expected maximum flows through reliable networks. Our strategy tries to minimize the repetition of computational effort while evaluating network states sampled using the crude Monte ...
Megha Sharma, Ghosh, Diptesh
core
, 2021 Given a graph with a source and a sink node, the NP-hard maximum k-splittable s,t-flow (MkSF) problem is to find a flow of maximum value from s to t with a flow decomposition using at most k paths.
Spenke, Ines +2 more
core +1 more source
Quantitative methods for evaluating the performance mechanism of management of financial flows
Вестник СибАДИ, 2017 The article identifies factors rationalization of financial flows. Considered the content of the control mechanism of financial flows. The content of the financial and economic approach based on identifying what the maximum income can be obtained by ...
S. M. Khairova, B. G. Khairov
doaj +1 more source
Variability and change of precipitation and flood discharge in a Japanese river basin
Journal of Hydrology: Regional Studies, 2019 Study region: The Banjo River basin on Kyushu Island in the southwest of Japan. Study focus: This study focuses on the impact of local and/or large scale climate change on the river flow in the small and steep river basin.
Makoto Higashino, Heinz G. Stefan
doaj +1 more source
Constrained Maximum Flow in Stochastic Networks
2014 IEEE 22nd International Conference on Network Protocols, 2014 Solving network flow problems is a fundamental component of traffic engineering and many communications applications, such as content delivery or multi-processor scheduling. While a rich body of work has addressed network flow problems in "deterministic networks" finding flows in "stochastic networks" where performance metrics like bandwidth and delay ...
Kuipers, F.A. (author) +3 more
openaire +3 more sources
Capital flows to transition economies: what is the role of external shocks? [PDF]
During the recent international financial crisis, capital flows into Central and Eastern European transition economies have faced a serious threat of a “sudden stop.†But the specific dangers depend on these flows` macroeconomic determinants, which ...
Scott W Hegerty
core