Search Results - (( basic optimization path algorithm ) OR ( using modification drop algorithm ))
Search alternatives:
- basic optimization »
- using modification »
- optimization path »
- modification drop »
- path algorithm »
- drop algorithm »
-
1
Synthesis of transistor chaining algorithm for CMOS cell layout using euler path / Sukri Hanafiah
Published 1997“…The comparison between euler's path and Bipartite graph Algorithm [14] will be made at the end this of this report to see which one give optimal chaining .…”
Get full text
Get full text
Thesis -
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 2021“…To solve the redundancy resolution, meta-heuristic optimizations, namely Genetic Algorithm (GA) and Whale Optimization Algorithm (WOA), are applied to search optimal trajectories inside local orientation angle boundaries. …”
Get full text
Get full text
Get full text
Article -
4
Cyclic Path Planning Of Hyper-Redundant Manipulator Using Whale Optimization Algorithm
Published 2023Article -
5
Finding minimum path by using Genetic Algorithm (GA)/ Siti Zuraifah Hashim
Published 2007“…It makes use of three basic operations in order to optimize this problem. …”
Get full text
Get full text
Thesis -
6
Path planning algorithm for a car like robot based on MILP method
Published 2013“…This project is presents an algorithm for path planning optimal routes mobile robot “like a car” to a target in unknown environment. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
7
Mobile First-Person Shooter (FPS) Game Using Basic Theta* Algorithm / Muhammad Syurahbil Abd Rohaman
Published 2020“…This study shows that Basic Theta* is able to produce the true shortest path compared to A* which produced slightly longer path. …”
Get full text
Get full text
Thesis -
8
Genetic algorithm optimization for coefficient of FFT processor
Published 2010Get full text
Get full text
Get full text
Article -
9
Integration of enchanced jump point search (JPS) algorithm with modified bresenham technique for path planning in virtual grid-based environment
Published 2018“…Jump Point Search is one of the path finding algorithm with huge advantage of maintaining zero memory overhead as no preprocessing process involved. …”
Get full text
Get full text
Get full text
Thesis -
10
Robotic path planning using rapidly-exploring random trees
Published 2013“…However, the planned path by using basic RRT structure might not always be optimal in terms of path length. …”
Get full text
Get full text
Get full text
Thesis -
11
Embedding Malaysian House Red Ant Behavior into an Ant Colony System
Published 2008“…Problem statement: Ant Colony System (ACS) is the most popular algorithm used to find a shortest path solution in Traveling Salesman Problem (TSP). …”
Get full text
Get full text
Citation Index Journal -
12
Ant system with heuristics for capacitated vehicle routing problem
Published 2013“…As a route improvement strategy, two heuristics which are the swap among routes procedure and 3-opt algorithm are also employed within the ASH algorithm. …”
Get full text
Get full text
Thesis -
13
Artificial bee colony algorithm with proposed discrete nearest neighborhood algorithm for discrete optimization problems
Published 2021“…The proposed algorithm has been better than basic ABC in all tested problems with average of 0.570%.…”
Get full text
Get full text
Get full text
Article -
14
An enhanced swap sequence-based particle swarm optimization algorithm to solve TSP
Published 2021“…Since there is no known polynomial-time algorithm for solving large scale TSP, metaheuristic algorithms such as Ant Colony Optimization (ACO), Bee Colony Optimization (BCO), and Particle Swarm Optimization (PSO) have been widely used to solve TSP problems through their high quality solutions. …”
Get full text
Get full text
Get full text
Get full text
Get full text
Article -
15
Investigation of throughput and packet drop for Hata model on VANET using NCTUns simulation software for open area and suburban area / Rosmawani Samsudin
Published 2012“…Simulation is the research tools of choice to obtain throughput and packet dropped at each node at different speed. Simulation will be accomplish the modification by investigating the variation in vehicular mobility model between the measured and predict values, according to the Hata propagation model for open area and suburban area. …”
Get full text
Get full text
Thesis -
16
Enhanced Intelligent Water Drops Algorithm for University Examination Timetabling Problems
Published 2024“…This thesis presents an investigation of using the Intelligent Water Drops (IWD) algorithm to construct and produce good quality solutions for the UETP. …”
thesis::doctoral thesis -
17
Performance Comparison of Packet Queuing Algorithm in Wireless Networks
Published 2014“…Therefore, a good strategy of packet queuing algorithm is very important to avoid packets drop. …”
Get full text
Get full text
Article -
18
Performance Comparison of Packet Queuing Algorithm in Wireless Networks
Published 2014“…Therefore, a good strategy of packet queuing algorithm is very important to avoid packets drop. …”
Get full text
Get full text
Conference or Workshop Item -
19
Modeling and control of a Pico-satellite attitude using Fuzzy Logic Controller
Published 2010“…The performances obtained show that the optimized APFLC is better than the non-optimize APFLC in terms of RMSE and the settling time.…”
Get full text
Thesis -
20
On the delay and link utilization with the new-additive increase multiplicative decrease congestion avoidance and control algorithm
Published 2010“…We want to evaluate the effect of using the AIMD algorithm after developing it, which we called the New-AIMD algorithm, to find a new approach to measure the end-to-end delay and bottleneck link utilization and use the NCTUns simulator to obtain the results after making the modification for the mechanism. …”
Get full text
Get full text
Get full text
Article
