Search Results - (( developing solution graph algorithm ) OR ( java application need algorithm ))

VISUALIZATION OF GENETIC ALGORITHM BASED ON 2-D GRAPH TO ACCELERATE THE SEARCHING WITH HUMAN INTERVENTIONS. by FAROOQ, HUMERA

“…A tool termed as VIGA-20 (Visualization of Genetic Algorithm using 2-0 Graph) is implemented to accomplish this goal. …”
Get full text
Get full text

Enhancement of Ant System Algorithm for Course Timetabling Problem by Djamarus, Djasli

“…This research starts with developing an algorithm based on original concept of Ant System Algorithm. …”
Get full text
Get full text
Get full text

Direct approach for mining association rules from structured XML data by Abazeed, Ashraf Riad

Get full text
Get full text

Generic DNA encoding design scheme to solve combinatorial problems by Rofilde, Hasudungan

“…Currently, data encoding in DNA computing is tightly coupled with an algorithm that solves an instance of the problem. Solving another problem requires developing specific encoding and computations anew to prove DNA encoding and form the algorithm which is costly. …”
Get full text
Get full text

Multi-objective pareto ant colony system based algorithm for generator maintenance scheduling by Shimailawi, Shatha Abdulhadi Muthana

“…A graph model is developed to generate the units’ maintenance schedule. …”
Get full text
Get full text
Get full text

Implication of image processing algorithm in remote sensing and GIS applications by Pathan, Mubeena, Jusoff, Kamaruzaman, Mohd Sood, Alias, Razali, Yaakob, Qureshi, Barkatullah

“…Greedy algorithms expresses as a simple solution algorithm that choose a local optimum solution at each step to achieve a global optimum. …”
Get full text
Get full text
Get full text

Case study: Optimisation of Federal Land Development Authority Jengka supply chain management using P-graph approach by Haleem, A.A., Hashim, H., Varbanov, P.S., Yong, J.Y., Klemeš, J.J., Yusup, S.

“…Fuel consumption for transportation was calculated by taking into account the road profiles of the routes in Jengka. The resulting solution from Accelerated Branch and Bound algorithm in P-graph shows that the optimal solution is through building new plant in location 1, 2 and 4 for a profit of 77.35 M MYR/y (18.3 M â�¬/y). …”
Get full text
Get full text

Real-Time Video Processing Using Native Programming on Android Platform by Saipullah, Khairul Muzzammil

“…However for the Android platform that based on the JAVA language, most of the software algorithm is running on JAVA that consumes more time to be compiled. …”
Get full text
Get full text
Get full text

Ant colony optimization algorithm for load balancing in grid computing by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

“…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 other ant based algorithm, in terms of resource utilization. …”
Get full text
Get full text
Get full text

Power system intentional islanding for different contingency scenarios using discrete optimization technique by Nur Zawani Binti Saharuddin

“…The initial intentional islanding solution was determined using graph theory approach, to facilitate the proposed MDEP algorithm in determining the optimal intentional islanding strategy. …”

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

“…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

Solving single machine scheduling problem with maximum lateness using a genetic algorithm by Nazif, Habibeh, Lee, Lai Soon

“…The results showed that the proposed algorithm is generating better quality solutions compared to other variants of genetic algorithms…”
Get full text
Get full text
Get full text

The conceptual framework of knowledge of large scale and incomplete graphs of skyline queries optimization using machine learning by Noor, Ubair, Hassan, Raini, Dwi Handayani, Dini Oktarina

“…These continuous updates makes the graph to be highly dynamic, where nodes/edges are added to or removed from the graph always. …”
Get full text
Get full text
Get full text
Get full text

Neural network algorithm-based fall detection modelling by Mohd Yusoff, Ainul Husna, Koh, Cheng Zhi, Ngadimon, Khairulnizam, Md Salleh, Salihatun

“…High recognition of developed fall detection model is very significance for the elderly to detect the falls. …”
Get full text
Get full text
Get full text

Approximate maximum clique algorithm (AMCA): A clever technique for solving the maximum clique problem through near optimal algorithm for minimum vertex cover problem by Fayaz, Muhammad, Arshad,, Shakeel, Shah,, Abdul Salam, Shah, Asadullah

“…Material and methods: To test the proposed technique, selected approximation algorithms have been developed to small graph instances. …”
Get full text
Get full text
Get full text
Get full text

MOSDA: A proposal for multiple objective spiral dynamics algorithm by A. R.A., Azwan, Ahmad Nor Kasruddin, Nasir, Sha'akmal, S., A.R.M., Sawal

“…A method called “archive method” that is used in multi-objective particle swarm optimization (MOPSO) is adopted into SDA to develop its multiobjective (MO) type algorithm. Moreover, MOSDA is formulated by applying the widely-used concept of Pareto dominance to determine the movement of the particles and at the same time, the algorithm maintains the non-dominated solution in a setup global repository. …”
Get full text
Get full text
Get full text

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

“…Stochastic optimization algorithms are a new breed of optimizers that have recently been developed. …”
Get full text
Get full text

Computational comparison of major proposed methods for graph partitioning problem by Rais, H.M., Abed, S.A., Watada, J.

“…The approximate methods constitute a useful solution for these types of problems. Thus, many research studies have focused on developing meta-heuristic algorithms to tackle the graph partitioning problem. …”
Get full text
Get full text

Recent research in cooperative path planning algorithms for multi-agent using mixed- integer linear programming by Che Ku, Nor Azie Hailma, Omar, Rosli, Sabudin Elia Nadira, Sabudin Elia Nadira

“…This paper will review and compare the performances of those existing methods that can find solution without graph search algorithm such as Mixed-Integer Linear Programming (MILP) techniques which exactly solves the problem and then propose four alternative MILP formulations which are computationally less intensive and suited for real-time purposes, but yield a theoretically guaranteed suboptimal solution.…”
Get full text
Get full text

Design of DNA fragment assembly using IWP method on application-specific integrated-circuit / Hasniliati Hassan by Hassan, Hasniliati

“…After reviewing various algorithms, it was decided to apply de Bruijn graphs and Eulerian circuits that are based on graph theory. …”
Get full text
Get full text