Results 221 to 230 of about 99,580 (267)

Climate change effects on hydrologic processes and water quality in the Connecticut River watershed. [PDF]

PeerJ
Parry H, Randhir TO.
europepmc   +1 more source

Competition in the Segregation Mechanism of Granular Flow Within a 2D Rotating Drum Based on Magnetic Positioning Technology. [PDF]

Sensors (Basel)
Pan R, Chi ZP, Li YM, Li R, Yang H.
europepmc   +1 more source

Climate dependent feasibility of closing water and nutrient cycles in industrial aqua-agriculture. [PDF]

iScience
de Korte M, Bergman J, Gerard van Willigenburg L, Lobanov V, Joyce A, Cheng X, Keesman KJ.   +6 more
europepmc   +1 more source

Study on Erosion by Built-In Pulse Impactor Based on Simulation. [PDF]

ACS Omega
Wang H, Chen N, Zhang G, Zhu Q, Zheng X, Qian L, Xia C.   +6 more
europepmc   +1 more source

Flows of Conformally Coclosed G 2 -Structures with Dilaton. [PDF]

J Geom Anal
Karigiannis S, Picard S, Suan C.
europepmc   +1 more source

Analyzing leaping and movement potential at a migratory barrier. [PDF]

Sci Rep
Zielinski DP.
europepmc   +1 more source

MINIMUM FLOW VARIATION IN MAXIMUM FLOWS

Discrete Mathematics, Algorithms and Applications, 2010
Network flows are of growing interest in both applications and theory. Given a network flow with costs and arc capacities, the classical max flow-min cost problem is to send a given amount of flow from the source vertex to the sink vertex at least cost.
M. Masoumi, A. M. Mobasseri, A. R. Rezaei   +2 more
openaire   +2 more sources

Maximum Flow in Planar Networks

SIAM Journal on Computing, 1979
Efficient algorithms for finding maximum flow in planar networks are presented. These algorithms take advantage of the planarity and are superior to the most efficient algorithms to date. If the source and the terminal are on the same face, an algorithm of Berge is improved and its time complexity is reduced to $O(n\log n)$.
Alon Itai, Yossi Shiloach
openaire   +1 more source

Maximum flows in probabilistic networks

Networks, 1991
AbstractThe reliability of capacitated networks subject to random arc failures is evaluated by the expected value of maximum flow. It is known that calculating the expected value of maximum flow is NP‐hard, but a lower bound can be efficiently computed by the method of Carey and Hendrickson.
Hiroshi Nagamochi, Toshihide Ibaraki
openaire   +1 more source

Decentralized maximum‐flow protocols

Networks, 1982
AbstractThis article presents three protocols for obtaining maximum flow in a network by using distributed computation. Each node in the network has memory and processing capabilities and coordinates the algorithm with its neighbors by means of control messages. In the order presented, each protocol employs less communication than the previous one, but
openaire   +1 more source