Search Results - (( using second (problems OR problem) algorithm ) OR ( java application optimization algorithm ))

Web-based expert system for material selection of natural fiber- reinforced polymer composites by Ahmed Ali, Basheer Ahmed

“…Finally, the developed expert system was deployed over the internet with central interactive interface from the server as a web-based application. As Java is platform independent and easy to be deployed in web based application and accessible through the World Wide Web (www), this expert system can be one stop application for materials selection.…”
Get full text
Get full text

A discrete simulated kalman filter optimizer for combinatorial optimization problems by Suhazri Amrin, Rahmad

“…Two types of analysis are used to evaluate the proposed algorithm. First, the DSKFO algorithm is used to solve the travelling salesman problem (TSP), and then the algorithm's execution time is measured. …”
Get full text
Get full text

Tiki-taka algorithm: a novel metaheuristic inspired by football playing style by Mohd Fadzil Faisae, Ab Rashid

“…The algorithm was tested using 19 benchmark functions and five engineering design problems. …”
Get full text
Get full text
Get full text

Formulating new enhanced pattern classification algorithms based on ACO-SVM by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

“…ACO originally deals with discrete optimization problem.In applying ACO for solving SVM model selection problem which are continuous variables, there is a need to discretize the continuously value into discrete values.This discretization process would result in loss of some information and hence affects the classification accuracy and seeking time.In this algorithm we propose to solve SVM model selection problem using IACOR without the need to discretize continuous value for SVM.The second algorithm aims to simultaneously solve SVM model selection problem and selects a small number of features.SVM model selection and selection of suitable and small number of feature subsets must occur simultaneously because error produced from the feature subset selection phase will affect the values of SVM model selection and result in low classification accuracy.In this second algorithm we propose the use of IACOMV to simultaneously solve SVM model selection problem and features subset selection.Ten benchmark datasets were used to evaluate the proposed algorithms.Results showed that the proposed algorithms can enhance the classification accuracy with small size of features subset.…”
Get full text
Get full text
Get full text

Optimization of blood vessel detection in retina images using multithreading and native code for portable devices by Tran, Duc Ngoc, Hussin, Fawnizu Azmadi, Yusoff, Mohd Zuki

Get full text
Get full text

Performance evaluation of real-time multiprocessor scheduling algorithms by Alhussian, H., Zakaria, N., Abdulkadir, S.J., Fageeri, S.O.

“…These results suggests that optimal algorithms may turn to be non-optimal when practically implemented, unlike USG which reveals far less scheduling overhead and hence could be practically implemented in real-world applications. …”
Get full text
Get full text

Hybrid multiobjective genetic algorithm for integrated dynamic scheduling and routing of jobs and automated guided vehicles in flexible manufacturing systems by Umar, Umar Ali

“…First scenario uses static consideration, the second scenario uses dynamic consideration with machine failure recovery. …”
Get full text
Get full text

A new cryptographic algorithm based on decomposition problem in elliptic curve cryptography / Hilyati Hanina Zazali by Hilyati Hanina, Zazali

“…This approach presents better platform in finite field E as compared to the original works using the braid groups. The second algorithm deals with the use of Decomposition Problem in encryption scheme for ECC. …”
Get full text
Get full text
Get full text
Get full text
Get full text

Optimization Of Bar Linkage By Using Genetic Algorithms by Ramasamy, Mugilan

“…Penalty-based transformation method is used in this thesis to change the constrained problems into unconstrained ones. …”
Get full text
Get full text

Numerical solution of second order linear two-point boundry value problem using direct multistep method by Chew, Khui Tat

“…These methods are then used together with linear shooting technique in solving second order linear two-point boundary value problems using constant step size. …”
Get full text
Get full text

Route Optimization System by Zulkifli, Abdul Hayy

“…After much research into the many algorithms available, and considering some, including Genetic Algorithm (GA), the author selected Dijkstra's Algorithm (DA). …”
Get full text
Get full text

Development of optimization Alghorithm for uncertain non-linear dynamical system by Abdul Aziz, Mohd. Ismail, Yaacob, Nazeeruddin, Mohd. Said, Norfarizan, Hamzah, Nor Hazadura

“…Algorithms used to solve these problems are expected to satisfy the objectives consistently and since time translates into cost, must also be fast. …”
Get full text
Get full text

Harmony annealing algorithm for curriculum-based course timetabling problem by Wahid, Juliana, Mohd Hussin, Naimah

“…An attempt to solve these problems was made via an approach broken down into two parts; first, constructive algorithm with saturation degree approach was used to ensure a feasible solution, where the hard constraints are satisfied.Secondly, Harmony annealing algorithm was used to further improve the results obtained.The algorithm produced results that were not comparatively better than those previously known as best solution.With proper modification in terms of the approach in this algorithm would make the algorithm perform better on curriculum-based course timetabling.…”
Get full text
Get full text
Get full text

Reactive approach for automating exploration and exploitation in ant colony optimization by Allwawi, Rafid Sagban Abbood

“…Ant colony optimization (ACO) algorithms can be used to solve nondeterministic polynomial hard problems. …”
Get full text
Get full text
Get full text

Gravitational search – bat algorithm for solving single and bi-objective of non-linear functions by Abbas, Iraq Tareq

“…The second technique is to solve bi-objective functions by using the BOBAT algorithm. …”
Get full text
Get full text

Solving second order boundary value problem by shooting technique using backward difference formulae by Jafri, Mahanum Diana

“…In this thesis, the direct implicit multistep method presented in the form of backward difference formula are developed for solving directly two point boundary value problems (BVPs). This method will solve the nonlinear second order BVPs by shooting technique using constant and variable step size. …”
Get full text
Get full text

Genetic algorithm to optimize routing problem modelled as the travelling salesman problem by Muhammad Azrul Faiz , Nor Adzmi

“…This study presents genetic algorithm (GA) to solve routing problem modelled as the travelling salesman problem (TSP). …”
Get full text
Get full text

A fuzzy genetic algorithm based on binary encoding for solving multidimensional knapsack problems by Varnamkhasti, Mohammad Jalali, Lee, Lai Soon

“…Computational experiments are conducted on the proposed techniques and the results are compared with other genetic operators, heuristics, and local search algorithms commonly used for solving multidimensional 0/1 knapsack problems published in the literature.…”
Get full text
Get full text

Hybrid performance measures and mixed evaluation method for data classification problems by Hossin, Mohammad

“…This study investigates two different issues of performance measure in data classification problem. First, this study examines the use of accuracy measure as a discriminator for building an optimized Prototype Selection (PS) algorithm. …”
Get full text
Get full text

Hybrid harmony search algorithm for continuous optimization problems by Ala’a Atallah, Hamad Alomoush

“…The IHS-GWO is evaluated using two standard benchmarking sets and two real-world optimization problems. …”
Get full text
Get full text