نتایج جستجو برای: dynamic optimization
تعداد نتایج: 700590 فیلتر نتایج به سال:
Dynamic optimization problems often arise in advanced model based control. For example in model based predictive control and in the estimation of process parameters or not measured process signals, the underlying problems can be treated with optimization. A process model formulated in Modelica [10] can be used as a core part in the formulation of dynamic optimization problems. This allows an ef...
dynamic assessment according to vygotskys sociocultural theory, states that instruction and assessment are interrelated. using static forms of assessment with second and foreign language students could do more harm than good. many teachers neglect to take account of the complexity involved in learning a second or foreign language and often wonder why learning of a language take so long. thi...
We present a novel trajectory optimization framework to address the issue of robustness, scalability and efficiency in optimal control and reinforcement learning. Based on prior work in Cooperative Stochastic Differential Game (CSDG) theory, our method performs local trajectory optimization using cooperative controllers. The resulting framework is called Cooperative Game-Differential Dynamic Pr...
We formulate decomposition of two-dimensional shapes as a combinatorial optimization problem and present a dynamic programming algorithm that solves it.
cellular manufacturing system is one of the most important applications of group technology. design of this system involves many structural and operational issues, in which the cell formation and production planning are two important steps. in this paper, a new mathematical model is proposed for integration of cell formation and production planning problems with the aim of minimizing the overal...
Mutation has traditionally been regarded as an important operator in evolutionary algorithms. In particular, there have been many experimental studies which showed the effectiveness of adapting mutation rates for various static optimization problems. Given the perceived effectiveness of adaptive and self-adaptive mutation for static optimization problems, there have been speculations that adapt...
One of perspective ways to exploit sparsity in the dependency graph of an optimization problem is nonserial dynamic programming (NSDP) which allows to compute solution in stages, each of them uses results from previous stages. The class of discrete optimization problems with the block-tree matrix of constraints is considered. Nonserial dynamic programming (NSDP) algorithm for the solution of th...
Hydro-thermal scheduling is the problem of finding an optimal dispatch of power plants in a system containing both hydro and thermal plants. Since hydro plants are able to store water over long time periods, and since future inflows are uncertain due to precipitation, the resulting multi-stage stochastic optimization problem becomes challenging to solve. Several solution methods have been devel...
Multi-projector displays exhibit severe luminance variation. Matching luminance at every pixel to the pixel with most limited luminance range leads to severe degradation in the dynamic range of the display, rendering it practically useless. We present a new optimization technique to manage the luminance in a smooth constraint manner to maintain a perceptual seamlessness while improving the dyna...
well-known seismic design codes have offered an alternative equivalent static procedure for practical purposes instead of verifying design trials with complicated step-y-step dynamic analyses. such a pattern of base-shear distribution over the building height will enforce its special stiffness and strength distribution which is not necessarily best suited for seismic design. the present study, ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید