نتایج جستجو برای: Time-Varying Optimization

تعداد نتایج: 2231451  

پایان نامه :دانشگاه آزاد اسلامی - دانشگاه آزاد اسلامی واحد تهران مرکزی - دانشکده برق و الکترونیک 1390

there are many approaches for solving variety combinatorial optimization problems (np-compelete) that devided to exact solutions and approximate solutions. exact methods can only be used for very small size instances due to their expontional search space. for real-world problems, we have to employ approximate methods such as evolutionary algorithms (eas) that find a near-optimal solution in a r...

Journal: :تحقیقات مالی 0
حسن حیدری استادیار دانشکده اقتصاد و مدیریت دانشگاه ارومیه، ایران احمد ملا بهرامی دانشجوی تحصیلات تکمیلی دانشکده اقتصاد و مدیریت دانشگاه ارومیه، ایران

in this paper, in order to optimize the portfolio consisting of selected industrial stocks of petroleum products, automobiles and parts, electrical industry and extraction of minerals from tehran stock exchange member, first, time – varying conditional covariance matrix has been estimated based on the following multivariate garch models: diagonal-vech (1,1), ccc (1,1) and diagonal -bekk (1,1). ...

Journal: :IEEE Transactions on Signal Processing 2022

This paper studies streaming optimization problems that have objectives of the form $ \sum _{t=1}^{T}f(x_{t-1},x_{t})$. In particular, we are interested in how solution notation="LaTeX">$\hat{x}_{t|T}$ for notation="LaTeX">$t$th frame variables changes as notation="LaTe...

Journal: :IEEE Transactions on Automatic Control 2015

2011
Reza Dariani Arturo Buscarino Luigi Fortuna Mattia Frasca

In this paper, the relation between synchronization and control of chaotic nodes connected through a time–varying network is discussed. In particular, the effects of pinning control on a set of moving chaotic agents are investigated showing that the role of system parameters, like agent density, is critical in order to reach the synchronous behavior and also to control the whole network by pinn...

Abstract. Time-varying network optimization problems have tradition-ally been solved by specialized algorithms. These algorithms have NP-complement time complexity. This paper considers the time-varying short-est path problem, in which can be optimally solved in O(T(m + n)) time,where T is a given integer. For this problem with arbitrary waiting times,we propose an approximation algorithm, whic...

Journal: :amirkabir international journal of electrical & electronics engineering 2015
a.s. ashtari a. khaki sedigh

model predictive controller is widely used in industrial plants. uncertainty is one of the critical issues in real systems. in this paper, the direct adaptive simplified model predictive control (smpc) is proposed for unknown or time varying plants with uncertainties. by estimating the plant step response in each sample, the controller is designed and the controller coefficients are directly ca...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید