نتایج جستجو برای: static traffic assignment
تعداد نتایج: 246534 فیلتر نتایج به سال:
In this paper, two quadratic observability normal forms dependent on output respectively correspondent to drift dominant term and forced dominant term are firstly discussed. Moreover characteristic numbers are studied in order to simplify the calculation of these two normal forms.
The experimental results on the behaviour of the characteristics of secondary particles depending on the disintegration degree of nuclei are used to determine the region of central collisions. It was therefore possible that : – the correlation between the prosesses of total disintegration of nuclei and the central collisions of nuclei had been shown; – the existence of the regime change points ...
We study a dynamic traffic assignment model, where agents base their instantaneous routing decisions on real-time delay predictions. formulate mathematically concise model and derive properties of the predictors that ensure prediction equilibrium exists. demonstrate versatility our framework by showing it subsumes well-known full information models, in addition to admitting further realistic as...
Deforestation is a well known transformation algorithm which can eliminate intermediate structures from functional programs. In previous work, we have shown how the deforestation algorithm can be extended to handle higher order programs. A higher order treeless form of expression was defined to ensure the termination of this algorithm. Our higher order algorithm was further extended by Seidl an...
This paper is about testability analysis for data-flow software. We describe an application of the SATAN method, which allows testability of data-flow designs to be measured, to analyze testability of the source code of critical data-flow software, such as avionics software. We first propose the transformation of the source code generated from data-flow designs into the Static Single Assignment...
Traffic assignment is used to determine the number of users on roadway links in a network. While this problem has been widely studied in transportation literature, its use of the concept of equilibrium has attracted considerable interest in the field of game theory. The approaches used in both transportation and game theory disciplines are explored, and the similarities and dissimilarities betw...
The rapid development of intelligent transportation system technologies and the policy emphasis on their deployment have increased the importance of predictive dynamic network flow models, especially so-called dynamic network loading and dynamic traffic assignment models. In this chapter we provide a critical review of analytic models used in predicting time-varying urban network flows. Specifi...
The class of simplicial decomposition (SD) schemes have shown to provide efficient tools for nonlinear network flows. When applied to the traffic assignment problem, shortest route subproblems are solved in order to generate extreme points of the polyhedron of feasible flows, and, alternately, master problems are solved over the convex hull of the generated extreme points. We review the develop...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید