Results 61 to 70 of about 119,914 (208)
Computing Maximum Flow with Augmenting Electrical Flows [PDF]
2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS), 2016 We present an $\tilde{O}\left(m^{\frac{10}{7}}U^{\frac{1}{7}}\right)$-time algorithm for the maximum $s$-$t$ flow problem and the minimum $s$-$t$ cut problem in directed graphs with $m$ arcs and largest integer capacity $U$. This matches the running time of the $\tilde{O}\left((mU)^{\frac{10}{7}}\right)$-time algorithm of Mądry (FOCS 2013) in the unit ...
openaire +5 more sources
On minimizing maximum transient energy growth [PDF]
, 2005 The problem of minimizing the maximum transient energy growth is considered. This problem has importance in some fluid flow control problems and other classes of non-linear systems.
Whidborne, James F. +2 more
core
Sliced-Wasserstein normalizing flows: beyond maximum likelihood training
, 2022 European Symposium on Artificial Neural Networks, Computational Intelligence and Machine LearningInternational audienceDespite their advantages, normalizing flows generally suffer from several shortcomings including their tendency to generate unrealistic
Chainais, Pierre +2 more
core +1 more source
Extreme value analysis of streamflow time series in Poyang Lake Basin, China
Water Science and Engineering, 2011 Extreme meteorological and hydrological events may cause major disasters and heavy social and economic losses. Therefore, more and more studies have focused on extreme hydro-meteorological events in various climates and geographic regions.
Peng Tian +3 more
doaj +1 more source
Incremental network design with maximum flows
European Journal of Operational Research, 2015 We study an incremental network design problem, where in each time period of the planning horizon an arc can be added to the network and a maximum flow problem is solved, and where the objective is to maximize the cumulative flow over the entire planning horizon.
Thomas Kalinowski +2 more
openaire +4 more sources
Modelling annual maximum river flows with generalized extreme value distribution [PDF]
, 2019 A good understanding of probability distribution of annual maximum river flow is believed to improve water resources planning and design. Based on the annual maximum river flow record over 20-48 years at 9 individual river sites in Sabah, the data set ...
R Y Cheong, Darmesah Gabda
core +1 more source
Maximum-Flow Neural Network: A Novel Neural Network for the Maximum Flow Problem
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2009 In advance of network communication society by the internet, the way how to send data fast with a little loss becomes an important transportation problem. A generalized maximum flow algorithm gives the best solution for the transportation problem that which route is appropriated to exchange data.
Masatoshi Sato +2 more
openaire +1 more source
Flows for Flows: Morphing one Dataset into another with Maximum Likelihood Estimation
, 2023 Many components of data analysis in high energy physics and beyond require morphing one dataset into another. This is commonly solved via reweighting, but there are many advantages of preserving weights and shifting the data points instead.
Raine, John Andrew +5 more
core +1 more source
Maximum entropy flows for single-source networks
, 1993 This paper was prompted by growing evidence that Shannon's measure of uncertainty can be used as a surrogate reliability measure for water distribution networks. This applies to both reliability assessment and reliability-governed design.
Templeman, A.B., Tanyimboh, T.T.
core +1 more source
On the maximum capacity augmentation algorithm for the maximum flow problem
Discrete Applied Mathematics, 1993 The subject of this paper is two variants of the classical path- augmentation algorithm for maximum capacitated flow problem. The main point of the paper is that both algorithms have polynomial bounds even when the capacities have real values. The first bound is \(O(m^ 2\log m)\) flow augmentations and \(O(m^ 3\log m)\) operations.
Donald Goldfarb, Jianxiu Hao
openaire +1 more source