نتایج جستجو برای: point algorithm
تعداد نتایج: 1214446 فیلتر نتایج به سال:
Abstract In order to limit the interference of cloud noise on ground scene information, detection has been a hot issue in research remote sensing image processing. Cloud labels clouds images at pixel level. The majority early systems rely manually created feature and threshold segmentation with limited generalizability. Remote based deep learning improved accuracy speed thanks quick development...
in this paper, we describe our implementation of an interior point algorithm for large scale systems. first we identify system with small and medium methods convex optimization, then we use interior point method for identification. finally we offer an interior point method that uses nonlinear cost function and see that we achieve a good trade-off between error and cpu time. actually, in this pa...
nowadays, economic load dispatch between generation units with least cost involved is one of the most important issues in utilizing power systems. in this paper, a new method i.e. water cycle algorithm (wca) which is similar to other intelligent algorithm and is based on swarm, is employed in order to solve the economic load dispatch problem between power plants. wca is used to solve complicate...
In this paper, the Vector Based Swarm Optimization method is used for designing an optimal controller for the maximum power point tracker of a stand-alone PV System. The proposed algorithm is executed on vectors in a multi-dimension vector space. These vectors by appropriated orientation converge to a global optimum while the algorithm runs. The Remarkable point of the VBSO algorithm is how us...
An infeasible interior-point algorithm for mixed symmetric cone linear complementarity problems is proposed. Using the machinery of Euclidean Jordan algebras and Nesterov-Todd search direction, the convergence analysis of the algorithm is shown and proved. Moreover, we obtain a polynomial time complexity bound which matches the currently best known iteration bound for infeasible interior-point ...
The mann fixed point algorithm play an importmant role in the approximation of fixed points of nonexpansive operators. In this paper, by considering new conditions, we prove the weak convergence of mann fixed point algorithm, for finding a common fixed point of two nonexpansive mappings in real Hilbert spaces. This results extend the privious results given by Kanzow and Shehu. Finally, we give ...
some algorithms for nding common xed point of a family of mappings isconstructed. indeed, let c be a nonempty closed convex subset of a uniformlyconvex banach space x whose norm is gateaux dierentiable and let {tn} bea family of self-mappings on c such that the set of all common fixed pointsof {tn} is nonempty. we construct a sequence {xn} generated by the hybridmethod and also we give the ...
a robust and reliable quantitative structure-property relationship (qspr) study was established to forecast the melting points (mps) of a diverse and long set including 250 drug-like compounds. based on the calculated descriptors by dragon software package, to detect homogeneities and to split the whole dataset into training and test sets, a principal component analysis (pca) approach was used...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید