نتایج جستجو برای: approximate model
تعداد نتایج: 2156488 فیلتر نتایج به سال:
Transfer learning is a machine technique that takes pre-trained model has already been trained on related task, and adapts it for use new, task. This particularly useful in the context of predictive control (MPC), where deep transfer used to improve training MPC by leveraging knowledge gained from controllers. One way which applied using MPC, then fine-tuning controller new process automation s...
Often in practice the data on the mortality of a living unit correlation is due to the location of the observations in the study. One of the most important issues in the analysis of survival data with spatial dependence, is estimation of the parameters and prediction of the unknown values in known sites based on observations vector. In this paper to analyze this type of survival, Cox...
in this thesis, using concepts of wavelets theory some methods of the solving optimal control problems (ocps). governed by time-delay systems is investigated. this thesis contains two parts. first, the method of obtaining of the ocps in time delay systems by linear legendre multiwavelets is presented. the main advantage of the meth...
over the past decades a number of approaches have been applied for forecasting mortality. in 1992, a new method for long-run forecast of the level and age pattern of mortality was published by lee and carter. this method was welcomed by many authors so it was extended through a wider class of generalized, parametric and nonlinear model. this model represents one of the most influential recent d...
in this paper two different methods are presented to approximate the solution of the fractional black-scholes equation for valuation of barrier option. also, the two schemes need less computational work in comparison with the traditional methods. in this work, we propose a new generalization of the two-dimensional differential transform method and decomposition method that will extend the appli...
We propose a StochAstic Fault diagnosis AlgoRIthm, called Safari, which trades off guarantees of computing minimal diagnoses for computational efficiency. We empirically demonstrate, using the 74XXX and ISCAS85 suites of benchmark combinatorial circuits, that Safari achieves several orders-of-magnitude speedup over two well-known deterministic algorithms, CDA∗ and HA∗, for multiple-fault diagno...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید