Search Results - (( basic optimization path algorithm ) OR ( using vectorization means algorithm ))
Search alternatives:
- using vectorization »
- basic optimization »
- optimization path »
- means algorithm »
- path 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
SNR-Based OLSR Routing Protocol for Wireless Mesh Networks
Published 2009“…Unfortunately the routing protocols used such as AODV and Dynamic source routing (DSR) are hop count-based; where the routing algorithm uses the number of nodes to determine the optimum path to the destination. …”
Get full text
Get full text
Thesis -
6
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 -
7
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 -
8
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 -
9
Genetic algorithm optimization for coefficient of FFT processor
Published 2010Get full text
Get full text
Get full text
Article -
10
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 -
11
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 -
12
Power plant energy predictions based on thermal factors using ridge and support vector regressor algorithms
Published 2021“…This work aims to model the combined cycle power plant (CCPP) using different algorithms. The algorithms used are Ridge, Linear regressor (LR), and support vector regressor (SVR). …”
Get full text
Get full text
Get full text
Get full text
Article -
13
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 -
14
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 -
15
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 -
16
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 -
17
-
18
Support Vector Machines (SVM) in Test Extraction
Published 2006“…This project's objective is to create a summarizer, or extractor, based on machine learning algorithms, which are namely SVM and K-Means. Each word in the particular document is processed by both algorithms to determine its actual occurrence in the document by which it will first be clustered or grouped into categories based on parts of speech (verb, noun, adjective) which is done by K-Means, then later processed by SVM to determine the actual occurrence of each word in each of the cluster, taking into account whether the words have similar meanings with otherwords in the subsequent cluster. …”
Get full text
Get full text
Final Year Project -
19
Support Vector Machines (SVM) in Test Extraction
Published 2006“…This project's objective is to create a summarizer, or extractor, based on machine learning algorithms, which are namely SVM and K-Means. Each word in the particular document is processed by both algorithms to determine its actual occurrence in the document by which it will first be clustered or grouped into categories based on parts of speech (verb, noun, adjective) which is done by K-Means, then later processed by SVM to determine the actual occurrence of each word in each of the cluster, taking into account whether the words have similar meanings with otherwords in the subsequent cluster. …”
Get full text
Get full text
Final Year Project -
20
Enhanced artificial bee colony-least squares support vector machines algorithm for time series prediction
Published 2014“…The lvABC algorithm is introduced to overcome the local optima problem by enriching the searching behaviour using Levy mutation. …”
Get full text
Get full text
Get full text
Thesis
