Results 221 to 230 of about 1,124,505 (266)

Physiology-Mimicking Microfluidic Oxygenator with Good Hemocompatibility for <i>In Vitro</i> Respiratory Support of Preterm Infants. [PDF]

Micromachines (Basel)
Tao Y, Lu Y, Zeng W, Xiao D, Sun H.
europepmc   +1 more source

An approach for estimating thermoelectric module equivalent properties by thermal resistance and numerical modeling. [PDF]

iScience
Pham MQ, Nguyen VL, Vo TQ, Hong TD.
europepmc   +1 more source

Practical Microwave-Assisted Recirculated Flow Esterification at Atmospheric Pressure. [PDF]

ACS Omega
Schindler J, Harján R, Keglevich G.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

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

The maximum concurrent flow problem

Journal of the ACM, 1990
The maximum concurrent flow problem (MCFP) is a multicommodity flow problem in which every pair of entities can send and receive flow concurrently. The ratio of the flow supplied between a pair of entities to the predefined demand for that pair is called throughput and must be the same for all pairs of entities for ...
Farhad Shahrokhi, David W. Matula
openaire   +1 more source

Efficient maximum flow algorithms

Communications of the ACM, 2014
Though maximum flow algorithms have a long history, revolutionary progress is still being made.
Andrew V. Goldberg, Robert Endre Tarjan
openaire   +1 more source

Maximum skew-symmetric flows

1995
We introduce the maximum skew-symmetric flow problem which generalizes flow and matching problems. We develop a theory of skew-symmetric flows that is parallel to the classical flow theory. We use the newly developed theory to extend, in a natural way, the blocking flow method of Dinitz to the skew-symmetric flow case.
Andrew V. Goldberg, Alexander V. Karzanov   +1 more
openaire   +1 more source