نتایج جستجو برای: time varying optimization

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

Journal: :IEEE Transactions on Automatic Control 2021

The development of online algorithms to track time-varying systems has drawn a lot attention in the last years, particular framework convex optimization. Meanwhile, sparse optimization emerged as powerful tool deal with widespread applications, ranging from dynamic compressed sensing parsimonious system identification. In most literature on problems, some prior information system's evolution is...

Journal: :journal of ai and data mining 2016
m. maadi m. javidnia m. ghasemi

nowadays, due to inherent complexity of real optimization problems, it has always been a challenging issue to develop a solution algorithm to these problems. single row facility layout problem (srflp) is a np-hard problem of arranging a number of rectangular facilities with varying length on one side of a straight line with aim of minimizing the weighted sum of the distance between all facility...

Journal: :journal of advances in computer research 2013
mirsaeid hosseini shirvani mehran mohsenzadeh seyed majid hosseini shirvani

the large number of applications manages time varying data. existing databasetechnology seldom supports temporal database, tdb, according to time aspects.these intrinsic temporal database applications rely on such database which storesand retrieves time referenced data. moreover, applications need to be managed oncommon data items access simultaneously and to be precluded from inconsistencyas s...

2012
Kunal Srivastava Angelia Nedić Dušan Stipanović

We consider a min-max optimization problem over a time-varying network of computational agents, where each agent in the network has its local convex cost function which is a private knowledge of the agent. The agents want to jointly minimize the maximum cost incurred by any agent in the network, while maintaining the privacy of their objective functions. To solve the problem, we consider subgra...

Montadher Sami Shaker

This paper presents a new observer design methodology for a time varying actuator fault estimation. A new linear matrix inequality (LMI) design algorithm is developed to tackle the limitations (e.g. equality constraint and robustness problems) of the well known so called fast adaptive fault estimation observer (FAFE). The FAFE is capable of estimating a wide range of time-varying actuator fault...

Journal: :international journal of modeling, identification, simulation and control 0
ahmad kalhor تهران- خیابان کارگرشمالی- بالاتر از تقاطع جلال آل احمد- پردیس دانشکده های فنی - دانشکده برق nima hojjatzadeh university of tehran alireza golgouneh university of tehran

evolving models have found applications in many real world systems. in this paper, potentials of the evolving linear models (elms) in tracking control design for nonlinear variable structure systems are introduced. at first, an elm is introduced as a dynamic single input, single output (siso) linear model whose parameters as well as dynamic orders of input and output signals can change through ...

Proper and realistic scheduling is an important factor of success for every project. In reality, project scheduling often involves several objectives that must be realized simultaneously, and faces numerous uncertainties that may undermine the integrity of the devised schedule. Thus, the manner of dealing with such uncertainties is of particular importance for effective planning. A realistic sc...

Journal: :European Journal of Operational Research 2006
Sathaporn Opasanon Elise Miller-Hooks

In a recent paper, Opasanon and Miller-Hooks study multicriteria adaptive paths in stochastic time-varying networks. They propose a label correcting algorithm for finding the full set of efficient strategies. In this note we show that their algorithm is not correct, since it is based on a property that does not hold in general. Opasanon and Miller-Hooks also propose an algorithm for solving a p...

2013
Bruno F. Ribeiro Nicola Perra Andrea Baronchelli

Time-varying networks describe a wide array of systems whose constituents and interactions evolve over time. They are defined by an ordered stream of interactions between nodes, yet they are often represented in terms of a sequence of static networks, each aggregating all edges and nodes present in a time interval of size Δt. In this work we quantify the impact of an arbitrary Δt on the descrip...

Journal: :Theor. Comput. Sci. 2016
Klaus Wehmuth Eric Fleury Artur Ziviani

Different graph generalizations have been recently used in an ad-hoc manner to represent multilayer networks, i.e. systems formed by distinct layers where each layer can be seen as a network. Similar constructions have also been used to represent time-varying networks. We introduce the concept of MultiAspect Graph (MAG) as a graph generalization that we prove to be isomorphic to a directed grap...

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

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