Results 41 to 50 of about 2,192,114 (314)
Atomic Splittable Flow Over Time Games
CoRR, 2020 In an atomic splittable flow over time game, finitely many players route flow dynamically through a network, in which edges are equipped with transit times, specifying the traversing time, and with capacities, restricting flow rates. Infinitesimally small flow particles controlled by the same player arrive at a constant rate at the player's origin and ...
Antonia Adamik, Leon Sering
openaire +4 more sources
The Impact of Spillback on the Price of Anarchy for Flows over Time [PDF]
, 2020 Flows over time enable a mathematical modeling of traffic that changes as time progresses. In order to evaluate these dynamic flows from a game theoretical perspective we consider the price of anarchy (PoA). In this paper we study the impact of spillback effects on the PoA, which turn out to be substantial.
Jonas Israel, Leon Sering
openaire +2 more sources
Journal of Anaesthesiology Clinical Pharmacology, 2012 Background: In the administration of minimal flow anesthesia, traditionally a fixed time period of high flow has been used before changing over to minimal flow.
Tanuja Mallik +3 more
doaj +1 more source
Trials, 2021 Background The Consolidated Standards of Reporting Trials (CONSORT) statement aims to improve transparent reporting of randomised clinical trials. It comprises a participant flow diagram with the reporting of essential numbers for enrolment, allocation ...
Thea Nørgaard Rønsbo +4 more
doaj +1 more source
Nash Equilibria and the Price of Anarchy for Flows over Time [PDF]
Theory of Computing Systems, 2009 We study Nash equilibria in the context of flows over time. Many results on static routing games have been obtained over the last ten years. In flows over time (also called dynamic flows), flow travels through a network over time and, as a consequence, flow values on edges change over time.
Ronald Koch, Martin Skutella
openaire +2 more sources
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
An Introduction to Network Flows over Time [PDF]
, 2008 Flow variation over time is an important feature in network flow problems arising in various applications such as road or air traffic control, production systems, communication networks (e.g., the Internet), and financial flows. In such applications, flow values on arcs are not constant but may change over time.
openaire +1 more source
An integrated flask sample collection system for greenhouse gas measurements [PDF]
Atmospheric Measurement Techniques, 2012 A one hour integrated flask sampling system to collect air in automated NOAA/ESRL 12-flask packages is described. The integrating compressor system uses a mass flow controller to regulate the flow of air through a 15 l volume, thus providing a mixture of
J. Turnbull +10 more
doaj +1 more source
Optimal Rounding of Instantaneous Fractional Flows Over Time [PDF]
SIAM Journal on Discrete Mathematics, 2000 Summary: A transshipment problem with demands that exceed network capacity can be solved by sending flow in several waves. How can this be done in the minimum number, \(T\), of waves, and at minimum cost, if costs are piecewise linear convex functions of the flow? In this paper, we show that this problem can be solved using \(\min\left\{m,\log T,\frac{\
Lisa Fleischer, James B. Orlin
openaire +2 more sources
Unsteady cooperative flow in compression system
Propulsion and Power Research, 2012 When there are several bodies with relative motion in a flow field, such as the flow in the compression system of modern aero-engine, the flow field will have certain special features, one of which is that the time-space structure of such multi-bodies ...
Sheng Zhou +4 more
doaj +1 more source