Search Results - (( initial solution method algorithm ) OR ( using factorization learning algorithm ))
Search alternatives:
- using factorization »
- learning algorithm »
- initial solution »
- method algorithm »
- solution method »
-
1
CAT CHAOTIC GENETIC ALGORITHM BASED TECHNIQUE AND HARDWARE PROTOTYPE FOR SHORT TERM ELECTRICAL LOAD FORECASTING
Published 2017“…To overcome these ANN problems, the Genetic Algorithm (GA) has been most frequently used for this purpose, however, some drawbacks of GA include, slow search speed and dependence on initial parameters. …”
Get full text
Get full text
Thesis -
2
Modeling flood occurences using soft computing technique in southern strip of Caspian Sea Watershed
Published 2012“…In recent years soft computing methods like fuzzy logic and genetic algorithm are being used in modeling complex processes of hydrologic events. …”
Get full text
Get full text
Thesis -
3
Balancing Exploitation And Exploration Search Behavior On Nature-Inspired Clustering Algorithms
Published 2018“…In the OGC framework, the exhibited explorative search behavior of the Gravitational Clustering (GC) algorithm has been addressed by (i) eliminating the agent velocity accumulation, and (ii) integrating an initialization method of agents using variance and median to subrogate the exploration process. …”
Get full text
Get full text
Thesis -
4
Digital economy tax compliance model in Malaysia using machine learning approach
Published 2021“…Based on the validation of training data with the presence of seven single classifier algorithms, three performance improvements have been established through ensemble classification, namely wrapper, boosting, and voting methods, and two techniques involving grid search and evolution parameters. …”
Get full text
Get full text
Get full text
Article -
5
Clustering ensemble learning method based on incremental genetic algorithms
Published 2012“…In addition, experiments prove that incremental genetic-based clustering ensemble algorithm speed up to converge into an optimal clustering solution, where pattern ensemble learning method and the cluster partitions produced by the threshold fuzzy c-means clustering algorithm are employed as recombination operator and initial population, respectively.…”
Get full text
Get full text
Thesis -
6
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 -
7
Combining approximation algorithm with genetic algorithm at the initial population for NP-complete problem
Published 2018“…In Genetic Algorithm (GA), the prevalent approach to population initialization are heuristics and randomization. …”
Get full text
Get full text
Article -
8
Initialization Methods For Conventional Fuzzy C-Means And Its Application Towards Colour Image Segmentation
Published 2011“…Due to its capability in providing a particularly promising solution to clustering problems, the conventional Fuzzy C-Mean (FCM) algorithm is widely used as a segmentation method. …”
Get full text
Get full text
Thesis -
9
Comparison between Newton’s Method and a new Scaling Newton Method / Ramizah Baharuddin
Published 2021“…Newton's Method also called the Newton-Raphson method is a recursive algorithm for approximating the root of a differentiable function. …”
Get full text
Get full text
Thesis -
10
Shooting method with root finding to solve boundary value problems / Aryani Rima Matakim
Published 2025“…This method involves guessing initial conditions and iteratively adjusting them until the solution satisfies the boundary conditions at the other end of the domain. …”
Get full text
Get full text
Thesis -
11
A Confined Workforce Planning Model with Plugging for Service Organizations Using Network Flow Under Finite Horizon, Varying Demand Senario
Published 2015“…The study uses the Shortest Path method of the network flow models and identifies the optimum capacity required in each period of the planning horizon using Dijikstra’s Algorithm. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
12
Enhancing the RC4 algorithm by eliminating the Initiative Vector (IV) transmission
Published 2025“…This paper introduces an innovative approach to address the vulnerabilities of the RC4 encryption algorithm by employing an Initiative Vector (IV). The proposed method incorporates a lengthy random text without transmitting an initialization vector. …”
Get full text
Get full text
Get full text
Article -
13
Automatic selection of initial points for exploratory vessel tracing in fluoroscopic images
Published 2011“…This paper presents a new method for efficient selection of initial points for exploratory tracing algorithms. …”
Get full text
Get full text
Get full text
Article -
14
Hybrid tabu search – strawberry algorithm for multidimensional knapsack problem
Published 2022“…The Greedy heuristics by ratio was employed to construct an initial solution. Next, the solution was enhanced by using the hybrid TS-SBA. …”
Get full text
Get full text
Get full text
Thesis -
15
Approximating Non Linear Higher Order ODEs By A Three Point Block Algorithm
Published 2024journal::journal article -
16
Flexible job shop scheduling using priority heuristics and genetic algorithm
Published 2010“…Then, the validation of proposed genetic algorithm with reinforced initial population (GA2) has been checked with random keys genetic algorithm (RKGA). …”
Get full text
Get full text
Thesis -
17
-
18
Direct solutions of N-th order initial value problems in decomposition series
Published 2023“…In this paper, a class of linear and non-linear nth-order initial value problems (IVPs) is considered. The solutions of these IVPs are obtained by adapting the modified Adomian decomposition method (MADM) as an algorithm for approximating the solutions of the equations in a sequence of time intervals (i.e. time steps). …”
Article -
19
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 -
20
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
