Solving Systems of Nonlinear Equations Using A Globally Convergent Optimization Algorithm
Solving systems of nonlinear equations is a relatively complicated problem for which
Articles, journals and conferences in one search. An exact title, DOI or ISSN is listed first.
In the search box: "exact phrase" · -leave out · OR · prefix* · title: author: journal:
Solving systems of nonlinear equations is a relatively complicated problem for which
proposed algorithm, after the fusion of the fast convergence of the AFS algorithm and the global search capability of the DNA-G algorithm to drastically optimize the position vector
strategies are based on users interest (i.e. positive preferences).The main focus is on search engine personalization and to develop several concept-based user profiling methods. Concept-based user profiling…
describe its dynamic feature. In such a case, the search space becomes too big to be adequately explored by conventional algorithms, causing the decline of their optimization performance. We developed ... MPGA), which…
Quasi-Newton methods [] to derive a hybrid CG algorithm that utilizes data available from recent iterations. The computation of the search directions, at each iteration, is done in two steps ... dimensions ranging 2 ≤ n…
studied. This paper studies application of genetic algorithm to solve the genetic algorithm. A population search strategy basically does not depend on the knowledge of space or other auxiliary information ... change…
block. This paper describes a new method for error detection in syndrome and chien search block of BCH decoder. The proposed syndrome block is used to reduce the number ... corresponding odd number syndromes. The new…
feature selection method. Inspired by the hunting behavior of Siberian tigers, the SSTO algorithm mimics the search and optimization process to identify the most influential features for performance prediction
This paper focuses on Graphs Traversal Algorithms Breadth First Search (BFS) and Depth First Search (DFS) used in data structure and also gives an idea of complexity. The time complexity
features are extracted, a feature level fusion is carried out using the optimization algorithm called, Group Search Optimization. Then, recognition is done using the trained features by different classifiers such
Local Search (LS) procedure is a search facilitator, giving memetic algorithms a hand to enhance their exploitation ability resulting in converging to higher quality solutions. In this paper, using
used in real applications like friend suggestion, photo recommendation, expert identification and social search. The proposed algorithm provides privacy framework for each user in Social Networks like Flickr
provided as a measure of confidence in the classification. Also like any search or matching algorithm, the analyst should confirm the match by his/her own inspection of the data
their dependency. Hence it does not implement any sequential order. Therefore Cloud Harmony Search Optimization (CHSO) algorithm has been proposed to include the sequential selection among the tasks. This algorithm
spam refers to techniques that manipulates the ranking algorithms of web search engines and cause them to rank search results higher than they deserve [1]. The spam web pages
order to overcome this disadvantage, a new method based on a Shrinking Search Space (3S) algorithm is proposed in this paper. The method is applied on statistical bi-level thresholding
ligand docking, the first and foremost major step was energy minimization and conformation search analysis. Different algorithms were used to perform the task. Three major algorithms are considered in this
easier to develop and maintain. In this paper, I propose two algorithms, one as a search optimization technique and another as a multiobjective fitness evaluation function of the search technique
nodes and data structure prefix coding heel traverse tree generative algorithm, the algorithm is helpful for fuzzy searching and systematic analysis seeking, in addition, the algorithm doesn’t need
incorporating the labor division mechanism into ABC algorithm, which is achieved by individual specialization and role plasticity. We specify three different search methods for employed bees, onlooker bees and scout…
imperialist competitive algorithm for solving NCOP is proposed. First, we review some existing excellent algorithms for solving NOCP; then, the nonlinear constrained optimization problem is transformed into a bi…
The needs of Cloud computing is increasing due to massive increase of
feedback model via cross domain learning , GMISVM , Laplacian Regularized Least Squares(LapRLS), Search Result Clustering(SRC)Algorithm , Biased Discriminative Euclidean embedding (BDEE)to refine the image retrieval…
accounts for respiratory artifact during scan acquisition. As second and third pass search is initiated, the algorithm continues to “learn” upon the subsequent pass. Hence, each application is produces greater
routing protocol common attack method. Ant colony algorithm is a distributed parallel algorithm. A single ant search process is independent of each other, easy to fall into local optimum
For authors and organisers
Find the right journal for your paper and submit your manuscript.