Search Results - (( java ii optimization algorithm ) OR ( basic complex path algorithm ))
Search alternatives:
- ii optimization »
- path algorithm »
- basic complex »
- complex path »
- java »
-
1
Cyclic Path Planning Of Hyper-Redundant Manipulator Using Whale Optimization Algorithm
Published 2021“…This paper develops a path planning algorithm of hyper-redundant manipulators to achieve a cyclic property. …”
Get full text
Get full text
Get full text
Article -
2
Particle swarm optimization (PSO) for CNC route problem
Published 2002“…The algorithm used in this project is the Global Best (gbest) algorithm where it is a basic algorithm of Particle Swarm Optimization which applicable the shortest time and path of CNC machine to complete the process of drilling. …”
Get full text
Get full text
Undergraduates Project Papers -
3
Performance evaluation of real-time multiprocessor scheduling algorithms
Published 2016“…The aim of this evolution is to reflect the unseen time overhead incurred by optimal real-time algorithm, represented by LRE-TL, which might hinder the claimed optimality of such algorithms when they are practically implemented. …”
Get full text
Get full text
Conference or Workshop Item -
4
Cyclic Path Planning Of Hyper-Redundant Manipulator Using Whale Optimization Algorithm
Published 2023Article -
5
Route Optimization System
Published 2005“…I will be concentrating on finding the best algorithm for calculating the shortest distance between two points on a digital map. …”
Get full text
Get full text
Final Year Project -
6
IMPLEMENTATION OF BEHAVIOUR BASED NAVIGATION IN A PHYSICALLY CONFINED SITE
Published 2017“…Selected basic behaviour-based algorithms such as wallfollower, obstacle avoidance, escape route and target detection are to be combined and its efficiency is measured. …”
Get full text
Get full text
Final Year Project -
7
OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT
Published 2023“…To achieve this, we propose a new noble mechanism called Optimized Min-Min (OMin-Min) algorithm, inspired by the Min-Min algorithm. …”
Review -
8
-
9
Optimal route checking using genetic algorithm for UiTM's bus services / Tengku Salman Fathi Tengku Jaafar
Published 2006“…This research study with the development of the Optimal Route Checking Using Genetic Algorithm system should solve this scenario. …”
Get full text
Get full text
Thesis -
10
Comparison of performances of Jaya Algorithm and Cuckoo Search algorithm using benchmark functions
Published 2022“…Metaheuristic algorithms have been used successfully for solving different optimization problems. …”
Get full text
Get full text
Get full text
Get full text
Conference or Workshop Item -
11
-
12
-
13
-
14
Parallel distributed genetic algorithm development based on microcontrollers framework
Published 2023Conference paper -
15
Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization
Published 2019“…This study proposes a car parking management system which applies Dijkstra’s algorithm, Ant Colony Optimization (ACO) and Binary Search Tree (BST) in structuring a guidance system for indoor parking. …”
Get full text
Get full text
Thesis -
16
A random search based effective algorithm for pairwise test data generation
Published 2011“…This paper proposes an effective random search based pairwise test data generation algorithm named R2Way to optimize the number of test cases. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
17
Improving Class Timetabling using Genetic Algorithm
Published 2006“…We have targeted the research on class timetabling problem. Hence, Genetic Algorithm (GA) is used as one of the most popular optimization solutions. …”
Get full text
Get full text
Get full text
Thesis -
18
-
19
EasyA: Easy and effective way to generate pairwise test data
Published 2013“…Java program has been used to test the performance of the algorithm. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
20
Unconstraint assignment problem : a molecular computing approach
Published 2006“…On the other hand, for the computational phase, itis discovered that the complexity of the unconstraint assignment problem can be reduced to a path problem of a graph, and thepossibility to solve the unconstraint assignment problem by DNA computing approach is shown in detail.…”
Get full text
Get full text
Article
