نتایج جستجو برای: like algorithms
تعداد نتایج: 957857 فیلتر نتایج به سال:
This paper describes the synthesis of digitally excited pencil/flat top dual beams simultaneously in a linear antenna array constructed of isotropic elements. The objective is to generate a pencil/flat top beam pair using the excitations generated by the evolutionary algorithms. Both the beams share common variable discrete amplitude excitations and differ in variable discrete phase excitations...
In this study, Flake-like magnesium hydroxide (Mg(OH)2) and cubic-like aluminum hydroxide (Al(OH)3) nanostructures were synthesized via a simple co-precipitation method at relatively low temperature. Chemical properties and surface morphology of the magnesium hydroxide and aluminum hydroxide were characterized by X-ray diffraction analysis (XRD), scanning electron microscopy image (SEM), transm...
in this paper, we study the problem of minimizing the ratio of two quadratic functions subject to a quadratic constraint. first we introduce a parametric equivalent of the problem. then a bisection and a generalized newton-based method algorithms are presented to solve it. in order to solve the quadratically constrained quadratic minimization problem within both algorithms, a semidefinite optim...
بهسازی سیگنال گفتار آلوده به نویز یکی از مسائل مهم در پردازش سیگنال گفتار می باشد. در این پژوهش، هدف بررسی روشهای بهسازی سیگنال گفتار دوکاناله توسط الگوریتم های بهینه سازی اتفاقی (stochastic optimization algorithms) و ارزیابی عملکرد آنها با معیارهای استاندارد مختلف است. معمولاً برای طراحی سیستمی که بتواند به صورت وفقی نویز را از سیگنال آغشته به نویز کم کند، از الگوریتم های مبتنی بر گرادیان (grad...
abstract: in this thesis, we focus to class of convex optimization problem whose objective function is given as a linear function and a convex function of a linear transformation of the decision variables and whose feasible region is a polytope. we show that there exists an optimal solution to this class of problems on a face of the constraint polytope of feasible region. based on this, we dev...
Majority of chapters of this book show usefulness of greedy like algorithms for solving various combinatorial optimization problems. The aim of this chapter is to warn the reader that not always a greedy like approach is a good option and, in certain cases, it is a very bad option being sometimes among the worst possible options. Our message is not a discouragement from using greedy like algori...
The paper presents results on the runtime complexity of two ant colony optimization (ACO) algorithms: Ant System, the oldest ACO variant, and GBAS, the first ACO variant for which theoretical convergence results have been established. In both cases, as the class of test problems under consideration, a slight generalization of the well-known OneMax test function has been chosen. The techniques u...
Kronecker-like forms of a system pencil are useful in solving many computational problems encountered in the analysis and synthesis of linear systems. The reduction of system pencils to various Kronecker-like forms can be performed by structure preserving 0(n 3) complexity numerically stable algorithms. The presented algorithms form the basis of a modular collection of LAPACK compatible FORTRAN...
چکیده ندارد.
in the present study, a comprehensive and systematic strategy was described to evaluate the performance of several three-way calibration methods on a bio-analytical problem. parallel factor analysis (parafac), alternating trilinear decomposition (atld), self-weighted alternating trilinear decomposition (swatld), alternating penalty trilinear decomposition (aptld) and unfolded partial least squa...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید