Search Results - (( java waste optimization algorithm ) OR ( basic complex path algorithm ))
Search alternatives:
- waste 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
Cyclic Path Planning Of Hyper-Redundant Manipulator Using Whale Optimization Algorithm
Published 2023Article -
4
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 -
5
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 -
6
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 -
7
-
8
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 -
9
SG-PBFS : Shortest Gap-Priority Based Fair Scheduling technique for job scheduling in cloud environment
Published 2024“…Firstly, a Priority-Based Fair Scheduling (PBFS) algorithm has been introduced to schedule jobs so that jobs can access the required resources at optimal times. …”
Get full text
Get full text
Get full text
Get full text
Article -
10
Enhanced Mobility Solution In Mobile Ipv6 Network
Published 2008“…Enhanced Mobility Solution in Mobile IPv6 Network is extremely complex; the study addressed the multihoming issues of MIPV6 Networks on the basis of NEMO Basic Support, analyzes the benefits of multihoming and discusses implementation issues of all classes of multihoming possibilities. …”
Get full text
Get full text
Thesis -
11
Evolutionary cost-cognizant regression test case prioritization for object-oriented programs
Published 2019“…Re-execution of all test cases can be expensive as there might be wasting resources, could be costly and time consuming. …”
Get full text
Get full text
Thesis
