Search Results - (( java location based algorithm ) OR ( using value problem algorithm ))

Friendship Degree and Tenth Man Strategy: A new method for differentiating between erroneous readings and true events in wireless sensor networks by Adday, Ghaihab Hassan, Subramaniam, Shamala K., Zukarnain, Zuriati Ahmad, Samian, Normalia

“…The FD idea has previously been used to solve security problems, while military intelligence operations have inspired the TMS and have never been used in WSNs. …”
Get full text
Get full text

Development of mobile location based notification for crime cases tracking as an alternative alert for public safety / Noraini Ismail by Ismail, Noraini

Get full text
Get full text

Group formation using genetic algorithm by Che Ani, Zhamri, Husin, Mohd Zabidin, Yasin, Azman

“…However, due to lack of programming skills especially in Java programming language and the inability to have meetings frequently among the group members,most of the students’ software project cannot be delivered successfully.To solve this problem, systematic group formation is one of the initial factors that should be considered to ensure that every group consists of quality individuals who are good in Java programming and also to ensure that every group member in a group are staying closer to each other.In this research, we propose a method for group formation using Genetic Algorithms, where the members for each group will be generated based on the students’ programming skill and location of residential colleges.…”
Get full text
Get full text
Get full text
Get full text

Multi-floor indoor location estimation system based on wireless local area network by Chua, Tien Han

“…The most probable match is selected and returned as estimated location based on Bayesian filtering algorithm. Estimated location is reported as physical location and symbolic location. …”
Get full text
Get full text

Traveler’s recommendation mobile based system around Terengganu / Muhammad Aiman Syakir Shamsudin by Shamsudin, Muhammad Aiman Syakir

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

Mathematical simulation for 3-dimensional temperature visualization on open source-based grid computing platform by Alias, Norma, Satam, Noriza, Abd. Ghaffar, Zarith Safiza, Darwis, Roziha, Hamzah, Norhafiza, Islam, Md. Rajibul

“…The development of this architecture is based on several programming language as it involves algorithm implementation on C, parallelization using Parallel Virtual Machine (PVM) and Java for web services development. …”
Get full text
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

Campus safe: Safeguarding GPS-based Physical Identity and Access Management (PIAM) system with a lightweight Geo-Encryption by Yeo Zi Zian

“…Subsequently, this project embedded with a lightweight Geo-Encryption algorithm to preserve the privacy of real-time GPS location. …”
Get full text
Get full text
Get full text

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