نتایج جستجو برای: algorithm complexity

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

Extracting and tracking active objects are two major issues in surveillance and monitoring applications such as nuclear reactors, mine security, and traffic controllers. In this paper, a block-based similarity algorithm is proposed in order to detect and track objects in the successive frames. We define similarity and cost functions based on the features of the blocks, leading to less computati...

Journal: :نشریه دانشکده فنی 0
پرهام پهلوانی محمودرضا دلاور فرهاد صمدزادگان

multi-criteria shortest path problems (mspp) are called as np-hard. for mspps, a unique solution for optimizing all the criteria simultaneously will rarely exist in reality. algorithmic and approximation schemes are available to solve these problems; however, the complexity of these approaches often prohibits their implementation on real-world applications. this paper describes the development ...

A well-known clustering algorithm is K-means. This algorithm, besides advantages such as high speed and ease of employment, suffers from the problem of local optima. In order to overcome this problem, a lot of studies have been done in clustering. This paper presents a hybrid Extended Cuckoo Optimization Algorithm (ECOA) and K-means (K), which is called ECOA-K. The COA algorithm has advantages ...

Journal: :the modares journal of electrical engineering 2011
mahdi bekrani mojtaba lotfizad

one of the problems associated with adaptive fir filters in the identification of systems with long impulse responses, is their excessive computational complexity. recently a new kind of adaptive filters, based on three-level clipping of the input signal has been presented for reduction of their computational complexity. in this paper, a theoretical analysis of the steady-state misalignment of ...

A number of problems in several areas such as power transmission and distribution, communication and transportation can be formulated as a stochastic-flow network (SFN). The system reliability of an SFN can be computed in terms of all the upper boundary points, called d-MinCuts (d-MCs). Several algorithms have been proposed to find all the d-MCs in an SFN. Here, some recent studies in the liter...

The purpose of this paper is to examine the multidisciplinary design optimization (MDO) of a reentry vehicle. In this paper, optimization of a RV based on, minimization of heat flux integral and minimization of axial force coefficient integral and maximization of static margin integral along reentry trajectory is carried out. The classic optimization methods are not applicable here due to the c...

GH.R Amin

This paper proposes a new approach for determining efficient DMUs in DEA models using inverse optimi-zation and without solving any LPs. It is shown that how a two-phase algorithm can be applied to detect effi-cient DMUs. It is important to compare computational performance of solving the simultaneous linear equa-tions with that of the LP, when computational issues and complexity analysis are a...

Journal: :journal of chemical and petroleum engineering 2011
ناصر ثقه الاسلامی masood khaksar toroghi

laguerre function has many advantages such as good approximation capability for different systems, low computational complexity and the facility of on-line parameter identification. therefore, it is widely adopted for complex industrial process control. in this work, laguerre function based adaptive model predictive control algorithm (ampc) was implemented to control continuous stirred tank rea...

Journal: :International journal of Computer Networks & Communications 2016

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

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