Search Results - (( problem solving process algorithm ) OR ( java application using algorithm ))
Search alternatives:
- process algorithm »
- java application »
- solving process »
- using algorithm »
-
1
Improving Class Timetabling using Genetic Algorithm
Published 2006“…We have targeted the research on class timetabling problem. Hence, Genetic Algorithm (GA) is used as one of the most popular optimization solutions. …”
Get full text
Get full text
Get full text
Thesis -
2
Automated time series forecasting
Published 2011“…Moving Average, Decomposition, Exponential Smoothing, Time Series Regressions and ARIMA) were used.The algorithm was developed in JAVA using up to date forecasting process such as data partition, several error measures and rolling process.Successfully, the results of the algorithm tally with the results of SPSS and Excel.This automatic forecasting will not just benefit forecaster but also end users who do not have in depth knowledge about forecasting techniques.…”
Get full text
Get full text
Get full text
Monograph -
3
Text messaging encryption system
Published 2012“…Currently messages in phone can easily be read if the phone is stolen,or users might simply send it to the wrong number.Messages need to be encrypted to solve this problem. With this only the sender and recipient will be able to send and receive private information. …”
Get full text
Get full text
Undergraduates Project Papers -
4
Development of mobile application of event assistant and booking sport facilities for UiTM Seremban 3 Campus using wofkflow management system / Ahmad Haiqal Abd Halim, Ahmad Yusuf...
Published 2019“…In this research, its content of the step on how to apply the method of WfMS in a mobile application with the use of an android studio. The algorithm for the WfMS is written using Java script in this research. …”
Get full text
Get full text
Student Project -
5
Approximate maximum clique algorithm (AMCA): A clever technique for solving the maximum clique problem through near optimal algorithm for minimum vertex cover problem
Published 2018“…Background and Objective: The process of solving the Maximum Clique (MC) problem through approximation algorithms is harder, however, the Maximum Vertex Cover (MVC) problem can easily be solved using approximation algorithms. …”
Get full text
Get full text
Get full text
Get full text
Article -
6
Simulated Kalman Filter algorithms for solving optimization problems
Published 2019“…Optimization is an important process in solving most engineering problems. Unfortunately, many practical optimization problems cannot be solved to optimality within reasonable computational effort. …”
Get full text
Get full text
Thesis -
7
Guided genetic algorithm for solving unrelated parallel machine scheduling problem with additional resources
Published 2022“…Here, we proposed genetic algorithm (GA) to solve the UPMR problem because of the robustness and the success of GA in solving many optimization problems. …”
Get full text
Get full text
Get full text
Article -
8
Generic DNA encoding design scheme to solve combinatorial problems
Published 2015“…The complexity of combinatorial problems is classified as NP meaning that algorithms are yet to exist to efficiently solve the problem. …”
Get full text
Get full text
Thesis -
9
Hybridizing guided genetic algorithm and single-based metaheuristics to solve unrelated parallel machine scheduling problem with scarce resources
Published 2023“…Genetic algorithm shows promising results in solving UPMR. …”
Get full text
Get full text
Get full text
Article -
10
Implication of image processing algorithm in remote sensing and GIS applications
Published 2011“…An algorithm solves the complex problems more efficiently and consistently. …”
Get full text
Get full text
Get full text
Article -
11
An improved sine cosine algorithm for solving optimization problems
Published 2018“…Due to its simplicity and less tedious parameter tuning over other multi-agent-based optimization algorithms, Sine Cosine Algorithm (SCA) has gained lots of attention from numerous researchers for solving optimization problem. …”
Get full text
Get full text
Get full text
Get full text
Conference or Workshop Item -
12
Levy slime mould algorithm for solving numerical and engineering optimization problems
Published 2022“…The proposed Levy Slime Mould Algorithm (LSMA) is a novel metaheuristic algorithm that integrates the Levy distribution into a new metaheuristic called Slime Mould Algorithm (SMA) for solving numerical and engineering problems. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
13
Levy tunicate swarm algorithm for solving numerical and real-world optimization problems
Published 2022“…The proposed Levy Tunicate Swarm Algorithm (LTSA) is a novel metaheuristic algorithm that integrates the Levy distribution into a new metaheuristic algorithm called Tunicate Swarm Algorithm (TSA) to solve numerical and real-world optimization problems. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
14
The Evolutionary Convergent Algorithm: A Guiding Path of Neural Network Advancement
Published 2025“…SGA is used in the process of solving optimization test problems by neural networks. …”
Article -
15
Optimization of mycelium growth using genetic algorithm for multi-objective functions
Published 2019“…Trade-off between the objectives, exist for the optimization process. To solve this issues, multi-objective genetic algorithm was chosen as the methodology for this project, specifically using NSGA-ii algorithm. …”
Get full text
Get full text
Get full text
Undergraduates Project Papers -
16
Hybridizing harmony search with local search based metaheuristic for solving curriculum based university course timetabling / Juliana Wahid
Published 2017“…SA is chosen to be hybridize with HSA for solving CBCTT because in literature, SA was successfully hybridize with HSA to solve other domain of problems. …”
Get full text
Get full text
Thesis -
17
Ant colony optimization in dynamic environments
Published 2010“…This thesis is an investigation into the application ' of ACO for solving dynamic optimization problems. The first objective of this study is to identify which ant algorithm performs the best under a dynamic environment. …”
Get full text
Get full text
Get full text
Thesis -
18
Finite impulse response optimizers for solving optimization problems
Published 2019“…Optimization problems are frequently found in various fields. The classification of estimation-based metaheuristic algorithms has been introduced for solving optimization problems. …”
Get full text
Get full text
Thesis -
19
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 -
20
Enhanced gravitational search algorithm for nano-process parameter optimization problem / Norlina Mohd Sabri
Published 2020“…Based on the capabilities of the metaheuristic algorithms, this research is proposing the enhanced Gravitational Search Algorithm (eGSA) to solve the nano-process parameter optimization problem. …”
Get full text
Get full text
Thesis
