• No results found

Algorithm for solving

Review on Genetic Algorithm for Solving Nonlinear Equations

Review on Genetic Algorithm for Solving Nonlinear Equations

... traditional algorithm in the convergence speed and convergence precision has made great progress, but, these algorithms depend on initial value , it is easy to cause a local solution, not the global optimal ...

5

A Hybrid Algorithm for Solving Steiner Tree Problem

A Hybrid Algorithm for Solving Steiner Tree Problem

... IWD algorithm called EIWD in which some elitist IWDs perform global soil updating instead of the best- iteration ...IWD algorithm for solving Steiner tree ...

7

An algorithm for solving a multi valued variational inequality

An algorithm for solving a multi valued variational inequality

... extragradient algorithm for solving the multi- valued variational inequality in which computing the supremum is ...for solving the multi-valued variational inequal- ...

9

A new parallel algorithm for solving parabolic equations

A new parallel algorithm for solving parabolic equations

... parallel algorithm for solving parabolic equations is ...new algorithm includes two domain decomposition methods, each method is applied to compute the values at (n + 1)st time level by use of known ...

16

An Improved Nearest Neighbor Algorithm for Solving TSP

An Improved Nearest Neighbor Algorithm for Solving TSP

... but solving TSP is quite difficult than anyone can ...neighbor algorithm for solving ...proposed algorithm and original algorithm to test ...

5

A Randomness Ant Colony Algorithm for Solving TSP

A Randomness Ant Colony Algorithm for Solving TSP

... colony algorithm on path pheromone in iterative ...colony algorithm, which means the longest two sub-paths in the current optimal solution path are crossed to optimize the optimal ...

5

An explicit algorithm for solving the optimize hierarchical problems

An explicit algorithm for solving the optimize hierarchical problems

... Corollary . Let C be a nonempty closed convex subset of a real Hilbert space H. Let A : H → H be a strongly positive linear bounded operator, f : C → H be ρ-contraction, B : C → H be β-inverse-strongly monotone and F ...

17

Woodpecker Mating Algorithm (WMA): a nature-inspired algorithm for solving optimization problems

Woodpecker Mating Algorithm (WMA): a nature-inspired algorithm for solving optimization problems

... intelligence algorithm that inspired on the mating behavior of ...Firefly Algorithm (FA) in scientific ...WMA algorithm has several operators for sequential and efficient implementation of ...

21

An optimization algorithm for solving a class of multiplicative problems

An optimization algorithm for solving a class of multiplicative problems

... The paper is described as follows. In Sections 2, first we convert the problem (MP) into an equivalent problem (EP), then a new linearizing method is proposed for generating the linear relaxation of the problem (EP). ...

7

On the Laplace transform decomposition algorithm for solving nonlinear differential equations

On the Laplace transform decomposition algorithm for solving nonlinear differential equations

... (ADM) and the Laplae transform deomposition algorithm (LTDA) for solving nonlinear.. dierential equations.[r] ...

7

Jaya: A simple and new optimization algorithm for solving constrained and unconstrained optimization problems   Pages 19-34
		 Download PDF

Jaya: A simple and new optimization algorithm for solving constrained and unconstrained optimization problems Pages 19-34 Download PDF

... own algorithm-specific control ...HS algorithm uses harmony memory consideration rate, pitch adjusting rate, and the number of ...respective algorithm-specific parameters. The proper tuning of the ...

16

Hybrid Algorithm for Solving the Quadratic Assignment Problem

Hybrid Algorithm for Solving the Quadratic Assignment Problem

... The simulated annealing method [31] is one of the oldest algorithms; it is an iterative metaheuristic very used to solve combinatorial optimization problems in the continuous and discrete case. The strong point of this ...

7

An elitist teaching-learning-based optimization algorithm for solving complex constrained optimization problems   Pages 535-560
		 Download PDF

An elitist teaching-learning-based optimization algorithm for solving complex constrained optimization problems Pages 535-560 Download PDF

... of algorithm- specific parameters in addition to tuning of common controlling ...the algorithm specific parameters influences the effectiveness of the ...TLBO algorithm does not require any ...

26

Solving fuzzy linear programming problem for fuzzy fourier motzkin elimination algorithm by trapezoidal fuzzy number

Solving fuzzy linear programming problem for fuzzy fourier motzkin elimination algorithm by trapezoidal fuzzy number

... for solving a linear system whose coefficient matrix is crisp and the right hand side column is an arbitrary fuzzy number ...elimination algorithm in fuzzy linear programming problem and obtaining the ...

6

Key  Recovery  for  LWE  in  Polynomial  Time

Key Recovery for LWE in Polynomial Time

... time algorithm for solving this generalized hidden number problem (GHNP), which is essentially solving an approximate-CVP in a particular lattice using LLL [LLL82] com- bined with Babai’s nearest ...

16

An Efficient Continued Fraction Algorithm for Nonlinear Optimization and Its Computer Implementation

An Efficient Continued Fraction Algorithm for Nonlinear Optimization and Its Computer Implementation

... for solving the nonlinear optimization ...new algorithm, there is some necessary background to go ...iterative algorithm for solving the nonlinear optimization problems and their correctness ...

8

Applying Surface Based DNA Computing for Solving the Dominating Set Problem

Applying Surface Based DNA Computing for Solving the Dominating Set Problem

... DNA computing was initially developed by Leonard Adleman in 1994 [1]. Adleman resolved an instance of Hamiltonian path problem just by handling the DNA molecules. In 1995, Lipton [3] presented a method for solving ...

5

Research on Initialization on EM Algorithm Based on Gaussian Mixture Model

Research on Initialization on EM Algorithm Based on Gaussian Mixture Model

... EM algorithm is a very popular maximum likelihood estimation method, the iterative algorithm for solving the maximum likelihood estimator when the observation data is the incomplete data, but also is ...

7

Review on fluid structure interaction solution method for biomechanical application

Review on fluid structure interaction solution method for biomechanical application

... FSI algorithm in biomechanic problem, namely the algorithm to solve the governing equations, the coupling between the fluid and structural parameter and finally the algorithm for solving the ...

5

Comparison of Evolutionary Optimization Techniques for Unconstrained

Comparison of Evolutionary Optimization Techniques for Unconstrained

... In ABC algorithm, the position of a food source represents a possible solution to the optimization problem. At initialization, a set of food source positions are randomly produced. The nectar amount retrievable ...

12

Show all 10000 documents...

Related subjects