Search Results - (( java implication based algorithm ) OR ( based simulation graph algorithm ))

Implementation of Graph Based Path Planning Algorithms on a Mobile Robot in a Confined Site by TANG, HON PANN

“…This project investigates the performance of three different graph based path planning algorithms used, relaxed A*, A* and Dijkstra’s algorithm in a few environments with different obstacles settings using Gazebo environment simulator and Turtlebot simulator (computer simulation) and 4WD navigation robot (real environment simulation).…”
Get full text
Get full text

Graph coloring program of exam scheduling modeling based on bitwise coloring algorithm using python by Arifin, Samsul, Muktyas, Indra Bayu, Al Maki, Wikky Fawwaz, Mohd Khairul Bazli, Mohd Aziz

“…In this article, the researchers design an algorithm and apply it to a computer program (Python) to solve graph coloring and to visualize the variation of exam scheduling modeling at Binus University in graphs based on the Bitwise Graph Coloring Algorithm. …”
Get full text
Get full text
Get full text

An improved algorithm for channel allocation on direct sequence spread spectrum by Handrizal, M

“…Graph coloring is a useful algorithm for channel allocation on Direct Sequence Spread Spectrum (DSSS).Through this algorithm,each access point (AP) that adjacent gives different channels based on colors available.Welsh Powell algorithm and Degree of saturation (Dsatur) are the popular algorithms being used for channel allocation in this domain. …”
Get full text
Get full text

Solving the minimum dominating set problem of partitioned graphs using a hybrid bat algorithm by Abed, S.A., Rais, H.M.

“…This paper investigates the swarm intelligence behaviour represented by a population-based approach called the bat algorithm (BA) to find the smallest set of nodes that dominate the graph. …”
Get full text
Get full text

Laser simulator: a novel search graph-based path planning approach by Ali, Mohammed A. H., Musa, Mailah

“…A novel technique called laser simulator approach for visibility search graph-based path planning has been developed in this article to determine the optimum collision-free path in unknown environment. …”
Get full text
Get full text
Get full text

Application of computer based simulation in gas network system using graph theory algorithms and numerical methods by Poh, Hong Hwee

Get full text
Get full text

IMPLEMENTATION OF GRAPH BASED PATH PLANNING ALGORITHMS FOR INDOOR NAVIGATION by SYED KHAIZURA, SYED HUSEIN KAMIL

“…In which the obstacles, start node and target node will be known in advance of starting the path planning algorithms. Based on the results of MATLAB simulation, the A* algorithm is the best algorithm in finding the shortest path with the least time taken. …”
Get full text
Get full text

Design and analysis of DNA fragment assembly's converter and checker modules using De Bruijin Graph / Mohd Shafiq Mohd Helmi by Mohd Helmi, Mohd Shafiq

“…Hybridization uses the array identifying algorithm to identify the sequence. The algorithm used to construct the module is Bruijn Graph. …”
Get full text
Get full text

Design and analysis of DNA fragment assembly's converter and checker modules using De Bruijin Graph : article / Mohd Shafiq Mohd Helmi by Mohd Helmi, Mohd Shafiq

“…Hybridization uses the array identifying algorithm to identify the sequence. The algorithm used to construct the module is Bruijn Graph. …”
Get full text
Get full text

African Buffalo Optimization (ABO): A New Metaheuristic Algorithm by Odili, Julius Beneoluchi, M. N. M., Kahar

“…The African Buffalo Optimization (A.B.0) algorithm simulates the African buffalos' behaviour by encapsulation in a mathematical model; which solves a number of discrete optimization problems using graph-based route planning, job scheduling and it extends Swarm Intelligence paradigms. …”
Get full text
Get full text
Get full text

Scalable workflow scheduling algorithm for minimizing makespan and failure probability by Abdul Aziz, Maslina, Ninggal, Izuan Hafez

“…A simulation-driven analysis based on realistic workflow application was demonstrated using DAG graph as a continuation of the Layered Workflow Scheduling Algorithm (LWFS). …”
Get full text
Get full text
Get full text
Get full text

Efficient signaling schedule for centralized and distributed scheduling algorithms for wimax multi-hop relay networks by Saqer, Ahmad Sabri Mousa

“…Validation of the proposed algorithm (MR-CSA) was based on comparison of its performance with the performance of the centralized pairing algorithm while the proposed MR-DSA algorithm was validated through comparing its performance against that of the factor-graph-based low-complexity distributed scheduling algorithm (FGDS) algorithms in terms of throughput and the average packet throughput. …”
Get full text
Get full text

An Improved of Channel Allocation for WLAN Using Vertex Merge Algorithm by Mr, Handrizal, Mr, Muhammad Zarlis, Noraziah, Ahmad, Abdalla, Ahmed N.

“…Each vertex on the graph will be arranged based on decreasing number of degree. …”
Get full text
Get full text

Algorithm for Identifying Minimum Driver Nodes Based on Structural Controllability by Reza, Haghighi, HamidReza, Namazi

“…We explore the relationship between structural controllability and graph reachability. Consequently, a simple graph-based algorithm is presented to obtain the minimum driver nodes. …”
Get full text
Get full text
Get full text
Get full text

Hybrid bat algorithm for minimum dominating set problem by Abed, S.A., Rais, H.M.

“…However, population-based algorithms are not good in exploiting the search space in comparison to single-solution based methods, therefore we included simulated annealing (SA) algorithm to balance between exploitation and exploration in order to reach a best possible solution. …”
Get full text
Get full text

Modeling of static and dynamic components of bio-nanorobotic systems by Gavgani, Hamidreza Khataee

Get full text
Get full text

A branch and bound and simulated annealing approach for job shop scheduling by Tan, Hui Woon, Salim, Sutinah

“…In the branch and bound approach, the job shop scheduling problem is represented by a disjunctive graph, then the optimal schedule is obtained using the branch and bound algorithm while simulated annealing is a local search based algorithm which will slightly perturb the initial feasible solution to decrease the makespan. …”
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

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

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

“…This article presents results of modelling for fall detection system by using nonlinear autoregression neural network NARnet algorithm. The algorithm is trained by network training function; LM, SCG and RP by collocation with threshold-based setting value. …”
Get full text
Get full text
Get full text