Search Results - (( java implementation modified algorithm ) OR ( using complete path algorithm ))

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

“…The thesis also provides a two different implementation of the modified FLEX algorithm using a java based parsers and XQuery implementation. …”
Get full text
Get full text

Finding multi-constrained path using genetic algorithm by Yussof S., See O.H.

“…This paper presents a solution to the MCP problem using genetic algorithm (GA). Through simulation, this algorithm has been shown to give a high probability of finding a feasible path if such paths exist. �2007 IEEE.…”

Adaptive path finding algorithm in dynamic environment for warehouse robot by Ng, Mun Kit, Chong, Yung Wey, Ko, Kwang man, Park, Young Hoon, Leau, Yu Beng

“…For example, A* path finding algorithm is developed to obtain the shortest path, while D* obtains a complete coverage path from source to destination. …”
Get full text
Get full text
Get full text

Modelling of multi-robot system for search and rescue by Poy, Yi Ler

“…Moreover, to cope with dynamic environments, a combination of global and local path planning methods is introduced. The PSO algorithm functions as a global path planner, determining the complete path for each robot, whereas a sensor-based obstacle avoidance algorithm serves as a local planner to avoid collision with dynamic obstacles during navigation. …”
Get full text
Get full text

A robust GA-based QoS routing algorithm for solving multi-constrained path problem by Yussof S., See O.H.

“…However, the actual link metrics in a QoS-aware network is dynamic and may continuously change over time and since the path given by the routing algorithm is computed using the state information available to the router, which may or may not be up-to-date, it is possible that a feasible path returned by the algorithm may turn out to be no longer valid. …”

Optimal path planning algorithm for swarm robots using bat algorithm with mutation (bam) by Lim, Pei Yee

“…This project is completed by creating a wheeled mobile robot where the robot uses a P controller. …”
Get full text
Get full text

Comparison of path planning in simulated robot by Ch’ng, Chee Yu’ng

“…There are 4 path planning algorithms will be compared, which are Dijkstra’s algorithm, A* algorithm, RapidExploring Random Tree (RRT) algorithm, and the last one is an algorithm modified from A*. …”
Get full text
Get full text

OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT by Murad S.S., Badeel R., Alsandi N.S.A., Alshaaya R.F., Ahmed R.A., Muhammed A., Derahman M.

“…To achieve this, we propose a new noble mechanism called Optimized Min-Min (OMin-Min) algorithm, inspired by the Min-Min algorithm. The objectives of this work are: i) to provide a comprehensive review of the cloud and scheduling process; ii) to classify the scheduling strategies and scientific workflows; iii) to implement our proposed algorithm with various scheduling algorithms (i.e., Min-Min, Round-Robin, Max-Min, and Modified Max-Min) for performance comparison, within different cloudlet sizes (i.e., small, medium, large, and heavy) in three scientific workflows (i.e., Montage, Epigenomics, and SIPHT); and iv) to investigate the performance of the implemented algorithms by using CloudSim. …”

Performance analysis of genetic algorithm (GA)-based multi-constrained path routing algorithm by Yussof S.

“…The performance of the algorithm is then compared with an exact algorithm called the depth first search and a common shortest path algorithm called the Dijkstra's algorithm. …”

Optimizing optimal path trace back for Smith-Waterman algorithm using structural modelling technique by Saliman, Nur Farah Ain

“…The optimizing of optimal path trace back system for Smith-Waterman algorithm using structural modelling techniques are presented in this paper. …”
Get full text
Get full text

Computationally-efficient path planning algorithms in obstacle-rich environments based on visibility graph method by Abdul Latip, Nor Badariyah

“…Cun·ent studies have been focused on developing path planning algorithms to satisfy the criteria of path planning namely minimum path length, low computation time and complete, i.e., it gives positive result if a path is available or negative if otherwise. …”
Get full text
Get full text
Get full text
Get full text

Optimizing optimal path trace back system for Smith-Waterman algorithm using structural modelling technique: article by Saliman, Nur Farah Ain

“…Then, the structural modelling is being use in this project in order to trace back by scanning the Smith-Waterman matrix calculation and find the optimal path. …”
Get full text
Get full text

An application of Floyd-Warshall Algortihm in finding shortest path of order picker in warehouse / Saidatul Aisyah Roslan, Siti Norhakimah Mohd Yatim and Siti Sarah Sulaiman by Roslan, Saidatul Aisyah, Mohd Yatim, Siti Norhakimah, Sulaiman, Siti Sarah

“…For the result, shortest path for the order pickers in iterations. The algorithm used can help the order picker to have the shortest path, but it have no direct path. …”
Get full text
Get full text

Applying Firefly Algorithm in Finding Optimized Path in PCB Holes Drilling Process by Asrani, Lit, Amar Faiz, Zainal Abidin, Muhammad Iqbal, Zakaria, Kian, Sheng Lim, M. Nasir, Ayob, Farhaana, Yakop

“…In order to minimize the distance traveled by the drill bit, Firefly Algorithm can be used. The proposed model applies Firefly Algorithm to search for the optimized path in PCB holes drilling process. …”
Get full text
Get full text

Optimum Time-Cost Trade-Off Strategies on Critical Path Method for Project Management by Khalaf, Wakas S.

“…When critical activity is stretched and the shortest possible of project completion is extended, other paths may also become noncritical, therefore, the noncritical activities can be stretched again until all the slack in the different noncritical paths is used up. …”
Get full text
Get full text

A generalized laser simulator algorithm for optimal path planning in constraints environment by Aisha, Muhammad

“…The experimental work investigates complete autonomous WMR path planning in the lab and road environments using live video streaming. …”
Get full text

Path Planning and Control of Mobile Robot in Road Environments using Sensor Fusion and Active Force Control by Ali, Mohammed A. H., Mailah, Musa

“…The sensor fusion algorithm is used to remove noises and uncertainties from sensors' data and provide optimum measurements for path planning. …”
Get full text
Get full text
Get full text

Novel algorithm for mobile robot path planning in constrained environment by Muhammad, Aisha, Ali, Mohammed A. H., Turaev, Sherzod, Shanono, Ibrahim Haruna, Hujainah, Fadhl, Mohd Zubir, Mohd Nashrul, Faiz, Muhammad Khairi, Mohd Faizal, Erma Rahayu, Abdulghafor, Rawad Abdulkhaleq Abdulmolla

“…The experimental work investigates a complete autonomous WMR path planning in the lab and road environments using a live video streaming. …”
Get full text
Get full text
Get full text
Get full text

An Enhanced Simulated Annealing Routing Algorithm for Semi-Diagonal Torus Network by Noraziah, Adzhar, Shaharuddin, Salleh

“…While this algorithm guarantees to find the shortest path for each single net, if it exists, each routed net will form obstacle for later paths. …”
Get full text
Get full text
Get full text

A hybrid sampling-based path planning algorithm for mobile robot navigation in unknown environments by Khaksar, Weria

“…Sampling-based motion planning is a class of randomized path planning algorithms with proven completeness. …”
Get full text
Get full text