Search Results - (( using value problem algorithm ) OR ( java application optimisation algorithm ))

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

“…Secondly, an expert system using Java programming technology with two tiers of search engine was developed to perform a fast selection of candidate materials in huge volume. …”
Get full text
Get full text

Study and Implementation of Data Mining in Urban Gardening by Mohana, Muniandy, Lee, Eu Vern

“…The system is essentially a three-part development, utilising Android, Java Servlets, and Arduino platforms to create an optimised and automated urban-gardening system. …”
Get full text
Get full text
Get full text

Enhanced Adaptive Confidence-Based Q Routing Algorithms For Network Traffic by Yap, Soon Teck

“…In CQ Routing Algorithm, the confidence value (C value) can be used to improve the quality of exploration in Q Routing Algorithm. …”
Get full text
Get full text

An algorithm for positive solution of boundary value problems of nonlinear fractional differential equations by Adomian decomposition method by A. I., Md. Ismail, Hytham. A., Alkresheh

“…In this paper, an algorithm based on a new modification, developed by Duan and Rach, for the Adomian decomposition method (ADM) is generalized to find positive solutions for boundary value problems involving nonlinear fractional ordinary differential equations. …”
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

Using genetic algorithm for solving N-Queens problem by Turky A.M., Ahmad M.S.

Modification of particle swarm optimization algorithm for optimization of discrete values by Mohd Yassin, Ahmad Ihsan, Jusoh, Muhammad Huzaimy, Abdul Rahman, Farah Yasmin

“…We propose a novel modification to the PSO algorithm to perform rapid discrete optimization. The proposed Discrete-PSO method (DPSO) uses a rescaling equation to convert the continuous-valued positions into discrete-valued variables. …”
Get full text
Get full text

Study on numerical solution of a variable order fractional differential equation based on symmetric algorithm by Liu, Jingrui, Pan, Dongyang

“…A fully symmetric classification of the boundary value problem for a class of fractional differential equations with variable sequences is determined by using a fully symmetric differential sequence sorting algorithm. …”
Get full text
Get full text
Get full text

Taguchi-Grey Relational Analysis Method for Parameter Tuning of Multi-objective Pareto Ant Colony System Algorithm by Muthana, Shatha Abdulhadi, Ku Mahamud, Ku Ruhana

“…These values can be benchmarked in solving multi-objective GMS problems using the multi-objective PACS algorithm and its variants.…”
Get full text
Get full text
Get full text

New heuristic function in ant colony system for the travelling salesman problem by Alobaedy, Mustafa Muwafak, Ku-Mahamud, Ku Ruhana

“…Ant Colony System (ACS) is one of the best algorithms to solve NP-hard problems.However, ACS suffers from pheromone stagnation problem when all ants converge quickly on one sub-optimal solution.ACS algorithm utilizes the value between nodes as heuristic values to calculate the probability of choosing the next node. …”
Get full text
Get full text
Get full text

Single Fitness Function to Optimize Energy using Genetic Algorithms for Wireless Sensor Network by Ismail Abdullah, Kalid Abdlkader Marsal

Hybrid of firefly algorithm and pattern search for solving optimization problems by Wahid, Fazli, Ghazali, Rozaida

“…Firefly algorithm (FA) is a newly introduced meta-heuristic, nature-inspired, stochastic algorithm for solving various types of optimization problems. …”
Get full text
Get full text

Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing by Husna, Jamal Abdul Nasir

“…Global pheromone update is performed after the completion of processing the jobs in order to reduce the pheromone value of resources. A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against existing grid resource management algorithms such as Antz algorithm, Particle Swarm Optimization algorithm, Space Shared algorithm and Time Shared algorithm, in terms of processing time and resource utilization. …”
Get full text
Get full text
Get full text

Electricity demand forecasting in Turkey and Indonesia using linear and nonlinear models based on real-value genetic algorithm and extended Nelder-Mead local search by Wahab, Musa

“…The second problem is the use of a single algorithm that failed to solve local optima. …”
Get full text
Get full text
Get full text

Feature selection and model selection algorithm using incremental mixed variable ant colony optimization for support vector machine classifier by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

“…In order to enhance SVM performance, these problems must be solved simultaneously because error produced from the feature subset selection phase will affect the values of the SVM parameters and resulted in low classification accuracy.Most approaches related with solving SVM model selection problem will discretize the continuous value of SVM parameters which will influence its performance.Incremental Mixed Variable Ant Colony Optimization (IACOMV) has the ability to solve SVM model selection problem without discretising the continuous values and simultaneously solve the two problems.This paper presents an algorithm that integrates IACOMV and SVM.Ten datasets from UCI were used to evaluate the performance of the proposed algorithm.Results showed that the proposed algorithm can enhance the classification accuracy with small number of features.…”
Get full text
Get full text
Get full text

Multi-Agent cubature Kalman optimizer: A novel metaheuristic algorithm for solving numerical optimization problems by Zulkifli, Musa, Zuwairie, Ibrahim, Mohd Ibrahim, Shapiai

“…CTT can use small values for parameters P(0), Q, and R, so CKF was developed to overcome KF and other estimation algorithms. …”
Get full text
Get full text
Get full text

Improved stochastic gradient descent algorithm with mean-gradient adaptive stepsize for solving large-scale optimization problems by Zulkifli, Munierah, Abd Rahmin, Nor Aliza, Wah, June Leong

“…Stochastic gradient descent (SGD) is one of the most common algorithms used in solving large unconstrained optimization problems. …”
Get full text
Get full text
Get full text

Application of intelligence based genetic algorithm for job sequencing problem on parallel mixed-model assembly line by Noroziroshan, Alireza, Mohd Ariffin, Mohd Khairol Anuar, Ismail, Napsiah

“…Hence using the proposed mathematical model for large size problem was time consuming and inefficient as so many job allocation values should be checked. …”
Get full text
Get full text
Get full text

A Preliminary Study on Camera Auto Calibration Problem Using Bat Algorithm by Mohd Annuar, Khalil Azha, Selamat, Nur Asmiza, Jaafar, Hazriq Izzuan, Mohamad, Syahrul Hisham

“…The main objective in camera auto calibration is to find intrinsic parameters values that minimize the cost function. This paper attempts to implement a stochastic optimization algorithm called Bat Algorithm in order to find optimal values of the intrinsic parameters. …”
Get full text
Get full text

New algorithm of two-point block method for solving boundary value problem with dirichlet and Neumann boundary conditions by Phang, Pei See, Abdul Majid, Zanariah, Ismail, Fudziah, Othman, Khairil Iskandar, Suleiman, Mohamed

Get full text
Get full text
Get full text