نتایج جستجو برای: global solution
تعداد نتایج: 888858 فیلتر نتایج به سال:
Estimating the lateral depth variations of the Earth’s crust from gravity data is a non-linear ill-posed problem. The ill-posedness of the problem is due to the presence of noise in the data, and also the non-uniqueness of the problem. Particle Swarm Optimization (PSO) is a stochastic population-based optimizer, originally inspired by the social behavior of fish schools and bird flocks. PSO is ...
this work is presented in five parts. in the first part preparation of the starting complex [pt(c^n)cl(dmso)], 1, in which c^n = n(1),c(2?)-chelated, deprotonated 2-phenylpyridine, and dmso = dimethylsulfoxide, and its reaction with 1 equiv of the biphosphine ligands bis(diphenylphosphino)amine, dppa, or bis(diphenylphosphino)methane, dppm, to give the complex [pt(c^n)cl(dppa)], 2, or [pt(c^n)c...
This paper presents an exact formulation of Stochastic or Unconditional Maximum Likelihood (UML) estimation for directions-of-arrival (DOA) finding. In the previous formulation of UML estimation, an important condition is missing. That is the non-negative definiteness of the covariance matrix of signal components without additive noises. Because of the lack of the important condition, inadequat...
Nonlinear Knapsack Problems (NKP) are the alternative formulation for the multiple-choice knapsack problems. A powerful approach for solving NKP is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. Despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...
this study investigates the relationship between field-related cognitive styles and global reading comprehension of hypertext. technically, field dependency is prevailing dominance of field on perception of parts, while global comprehension is skim-like reading to grasp the general content. in this research project, 60 senior and junior students of arak university majoring in english literature...
Mixed-integer polynomial programming (MIPP) problems are one class of mixed-integer nonlinear programming (MINLP) problems where objective function and constraints are restricted to the polynomial functions. Although the MINLP problem is NP-hard, in special cases such as MIPP problems, an efficient algorithm can be extended to solve it. In this research, we propose an algorit...
In this paper, an iterative method is proposed for solving matrix equation $sum_{j=1}^s A_jX_jB_j = E$. This method is based on the global least squares (GL-LSQR) method for solving the linear system of equations with the multiple right hand sides. For applying the GL-LSQR algorithm to solve the above matrix equation, a new linear operator, its adjoint and a new inner product are dened. It is p...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید