نتایج جستجو برای: total flow time
تعداد نتایج: 2895070 فیلتر نتایج به سال:
time–area method is one of the most widely applied techniques of watershed routing, and can be potentially used as a distributed model. in this paper, a fundamental flaw in the arrangement of subareas in the original time-area histogram is identified for one-dimensional flow. this is conducted on the basis of comparing time-area hydrograph with that of the kinematic wave theorem. accordingly, a...
We prove existence and uniqueness of weak solutions for the minimizing Total Variation ow with initial data in L1. We prove that the length of the level sets of the solution, i.e., the boundaries of the level sets, decreases with time, as one would expect, and the solution converges to the spatial average of the initial datum as t ! 1. We also prove that local maxima strictly decrease with time...
Abstract. In this paper we analyze iterative regularization with the Bregman distance of the total variation semi norm. Moreover, we prove existence of a solution of the corresponding flow equation as introduced in [8] in a functional analytical setting using methods from convex analysis. The results are generalized to variational denoising methods with L-norm fit-to-data terms and Bregman dist...
in the first part of this thesis we explored wetting and its dynamics for small droplets. first, we showed how a simple feature of water droplets on a surface, i.e. laplace pressure, can be exploited to build a micropump. we investigated capillary pumping in microchannels both experimentally and numerically. putting two droplets of different sizes at the in/outlet of a microchannel, will ge...
nowadays, the environmental impact of transportation project and, especially air pollution impacts, are major concerns in evaluating transportation projects. based on this concern, beside definition of traditional objective functions like total travel time and total investment cost, different type of environmental related function is considered as objective function in urban network design. in...
Minimizing total flow time in single machine environment with release time: an experimental analysis
We study the problem of minimizing total flow time on a single machine with job release times. This problem is NP-complete for which is no constant ratio approximation algorithm. Our objective is to study experimentally how well, on average, the problem can be solved. The algorithm we use produces non-preemptive schedules converted from preemptive ones. We evaluate average solution quality for ...
The intense exponential growth of the population in the United States and added vehicles to the roads has transportation planners working on solving the congestion issue. People have to travel longer distances and spend more time on the roads causing congestion of the current networks. Thus, the demand for new roadway and intersection design is a high priority, as wasted fuel and travel time in...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید