Search Results - (( initial solving method algorithm ) OR ( parametric classification using algorithm ))
Search alternatives:
- parametric classification »
- classification using »
- method algorithm »
- initial solving »
- using algorithm »
-
1
Hybrid conjugate gradient using exact line search in photovoltaic system / Muhammad Ariiq Iqbaal Azizul Firdaus
Published 2025“…There are a few classifications of CG method such as classical, hybrid, three-term and parametric CG methods. …”
Get full text
Get full text
Thesis -
2
Improvement of land cover mapping using Sentinel 2 and Landsat 8 imageries via non-parametric classification
Published 2020“…Nevertheless, AC is not required for LCM if the original multi-spectral image is used. The last phase involves developing a new fusion algorithm using SVM and Fuzzy K-Means Clustering (FKM) algorithms for Sentinel 2 data to enhance LCM accuracy. …”
Get full text
Get full text
Thesis -
3
Shooting method with root finding to solve boundary value problems / Aryani Rima Matakim
Published 2025“…In this study, the result of the shooting method combined with various root-finding algorithms such as the Bisection method, Secant method, Newton's method, Ridder's method, Halley’s method, Brent’s method, Modified Newton method and Improved Ostrowski’s method to solve BVPs is evaluated. …”
Get full text
Get full text
Thesis -
4
Multistage optimal homotopy asymptotic method for solving initial-value problems
Published 2016“…In this paper, a new approximate analytical algorithm namely multistage optimal homotopy asymptotic method (MOHAM) is presented for the first time to obtain approximate analytical solutions for linear, nonlinear and system of initial value problems (IVPs).This algorithm depends on the standard optimal homotopy asymptotic method (OHAM), in which it is treated as an algorithm in a sequence of subinterval. …”
Get full text
Get full text
Get full text
Article -
5
Validation on an enhanced dendrite cell algorithm using statistical analysis
Published 2017“…In this study, we evaluated the performance of the enhanced algorithm called dendrite cell algorithm using sensitivity, specificity, false positive rate, and accuracy and validated the result using parametric and non parametric statistical significant tests. …”
Get full text
Get full text
Get full text
Article -
6
A firefly algorithm based hybrid method for structural topology optimization
Published 2020“…In this paper, a firefly algorithm based hybrid algorithm through retaining global convergence of firefly algorithm and ability to generate connected topologies of optimality criteria (OC) method is proposed as an alternative method to solve stress-based topology optimization problems. …”
Get full text
Get full text
Article -
7
New uniform order eigh hybrid third derivative block method for solving second order initial value problems
Published 2016“…Hence, not only this article presents a new block method that can be adopted when solving real life problems modelled as second order IVPs, it also gives a more convenient algorithm for developing hybrid block methods.…”
Get full text
Get full text
Get full text
Article -
8
Hybrid tabu search – strawberry algorithm for multidimensional knapsack problem
Published 2022“…In 2011, a new metaheuristic known as Strawberry algorithm (SBA) was initiated. Since then, it has been vastly applied to solve engineering problems. …”
Get full text
Get full text
Get full text
Thesis -
9
Comparative Analysis of Low Discrepancy Sequence-Based Initialization Approaches Using Population-Based Algorithms for Solving the Global Optimization Problems
Published 2021“…Metaheuristic algorithms have been widely used to solve diverse kinds of optimization problems. …”
Get full text
Get full text
Get full text
Get full text
Get full text
Article -
10
A variant fisher and Jaikuamr algorithm to solve capacitated vehicle routing problem
Published 2017“…The initial clusters formation in a method are subjected to route optimization. …”
Get full text
Get full text
Get full text
Get full text
Proceeding Paper -
11
-
12
Enhanced Harris's Hawk algorithm for continuous multi-objective optimization problems
Published 2020“…A two-step enhanced non-dominated sorting HHMO (2SENDSHHMO) algorithm has been proposed to solve this problem. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
13
Modified Sumudu Transform Analytical Approximate Methods For Solving Boundary Value Problems
Published 2019“…In addition, for the STVIM method, a new algorithm has been proposed to solve various kinds of linear and nonlinear second-order two-point BVPs. …”
Get full text
Get full text
Thesis -
14
Modified Sumudu Transform Analytical Approximate Methods For Solving Boundary Value Problems
Published 2019“…In addition, for the STVIM method, a new algorithm has been proposed to solve various kinds of linear and nonlinear second-order two-point BVPs. …”
Get full text
Get full text
Thesis -
15
Parallel execution of diagonally implicit Runge-Kutta methods for solving IVPs.
Published 2009“…In this paper we used DIRK methods which are specifically designed for parallel execution to solve a set of initial value problems. …”
Get full text
Get full text
Article -
16
Solving Zhou's chaotic system using Euler's method
Published 2010“…An algorithm for Euler’s method is used to obtain an approximation for the initial-value problem for ordinary differential equation. …”
Get full text
Get full text
Get full text
Article -
17
An Integrated RRT*SMART-A* Algorithm for solving the Global Path Planning Problem in a Static Environment
Published 2023“…Thus, RRT*-Smart, a further development of RRT*, is considered ideal for solving RRT* problems. Unlike RRT*, RRT*-Smart applies a path optimization by removing the redundant nodes from the initial path when it is gained. …”
Get full text
Get full text
Get full text
Article -
18
AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT
Published 2023“…Thus, RRT*-Smart, a further development of RRT*, is considered ideal for solving RRT* problems. Unlike RRT*, RRT*-Smart applies a path optimization by removing the redundant nodes from the initial path when it is gained. …”
Get full text
Get full text
Get full text
Article -
19
AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT
Published 2023“…Thus, RRT*-Smart, a further development of RRT*, is considered ideal for solving RRT* problems. Unlike RRT*, RRT*-Smart applies a path optimization by removing the redundant nodes from the initial path when it is gained. …”
Get full text
Get full text
Get full text
Article -
20
AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT
Published 2023“…Thus, RRT*-Smart, a further development of RRT*, is considered ideal for solving RRT* problems. Unlike RRT*, RRT*-Smart applies a path optimization by removing the redundant nodes from the initial path when it is gained. …”
Get full text
Get full text
Get full text
Article
