Search Results - (( parallel optimization path algorithm ) OR ( problem implementation _ algorithm ))
Search alternatives:
- problem implementation »
- parallel optimization »
- optimization path »
- path algorithm »
-
1
Tool path generation of contour parallel based on ant colony optimisation
Published 2016“…An Ant Colony Optimisation (ACO) method is used to optimize the tool path length because of its capability to find the shortest tool path length. …”
Get full text
Get full text
Article -
2
Online teleoperation of writing manipulator through graphics processing unit based accelerated stereo vision
Published 2021“…These algorithms are then parallelized using Compute Unified Device Architecture CUDA C language to run on Graphics Processing Unit GPU for hardware acceleration. …”
Get full text
Get full text
Thesis -
3
Minimizing machining airtime motion with an ant colony algorithm
Published 2016Get full text
Get full text
Article -
4
-
5
Restoration planning strategy of transmission system based on optimal energizing time of sectionalizing islands / Dian Najihah Abu Talib
Published 2019“…There are two discrete optimization techniques used in this work, which are the Artificial Bee Colony algorithm and Evolutionary Programming. …”
Get full text
Get full text
Get full text
Thesis -
6
A novel large-bit-size architecture and microarchitecture for the implementation of Superscalar Pipeline VLIW microprocessors
Published 2008“…Different adder architectures are investigated for suitability on synthesis implementation of large data bus size adder for efficient usage within the ALU. An adder algorithm using repetitive constructs in a parallel algorithm that allows for efficient and optimal synthesis for large data bus size is proposed as a suitable implementation for the adder within the ALU. …”
Get full text
Thesis -
7
A 'snowflake' geometrical representation for optimised degree six 3-modified chordal ring networks
Published 2016“…A tree visualisation was constructed based on its connectivity to enable the generation of formulae for optimal diameter and average optimal path lengths. …”
Get full text
Get full text
Conference or Workshop Item -
8
Detection of black hole nodes in mobile ad hoc network using hybrid trustworthiness and energy consumption techniques
Published 2017“…In this thesis, a hybrid detection algorithm mechanism has been proposed which combines two detection algorithms based on nodes’ trustworthiness and energy consumption in a parallel manner in order to detect the black hole nodes. …”
Get full text
Get full text
Get full text
Thesis -
9
The Implementation of Genetic Algorithm in Path Optimization
Published 2005“…In this project, TSP will be used to model and easy visualize the path optimization problem and Genetic Algorithm (GA) was chosen to be implemented in resolving the problem. …”
Get full text
Get full text
Final Year Project -
10
Quantum Processing Framework And Hybrid Algorithms For Routing Problems
Published 2010“…These quantum algorithms can be applied to solve routing problem in the quantum networks and the quantum multicomputer. …”
Get full text
Get full text
Thesis -
11
Low-level hybridization scripting language with dynamic parameterization in PSO-GA / Suraya Masrom
Published 2015“…However, in many cases, implementing the suitable hybrid algorithms for a given optimization problem is a considerably difficult, which in most cases, is time consuming. …”
Get full text
Get full text
Thesis -
12
Festive season balancing groceries optimization / Fairuz Mohamed Razi
Published 2012“…An Artificial Intelligence method or technique is selected to provide a solution to this problem. The cause of the shortage in supply-demand is taken to be implemented in the Genetic Algorithms optimization concepts. …”
Get full text
Get full text
Thesis -
13
Chaotic Immune Symbiotic Organisms Search algorithm for solving optimisation problem
Published 2023“…Good performance of these heuristics-based algorithm has been implied through various implementation in solving optimisation problems. …”
Article -
14
Enhancing Market-Based Scheduling Algorithm on Globally Distributed Web Servers Using Least Suitable Sealed Bid Technique
Published 2006“…Scheduling of a multiple distributed servers is considered as a complex problem.considered as NP-complete problem,where no single efficient algorithm guaranteed to produce optimal results.This thesis investigates on how to find optimal solution for distribute system,by implementing market based scheduling Algorithm(MBSA).On implementing the MBSA, a new auction technique which is the least suitable sealed bid auction will be introduced.it is found that least suitable sealed bid technique will give the close-to-optimum solution.In the implementation, cooperative agents were used as a middleware between web servers and stand-alone schedulers. …”
Get full text
Get full text
Thesis -
15
An experiment on the performance of shortest path algorithm
Published 2016“…The main objective of this paper is to study and experiment the different shortest path algorithm such as Dijkstra’s algorithm, Symmetrical Dijkstra’s algorithm, A* algorithm, Bellman-Ford algorithm, Floyd-Warshall algorithm and Genetic algorithm in solving the shortest path problem. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
16
An experimental study of neighbourhood based metaheuristic algorithms for test case generation satisfying the modified condition / decision coverage criterion
Published 2018“…We have chosen four neighborhood based algorithms which are commonly used in optimization problems and divided them in newly implemented and re-implemented category. …”
Get full text
Get full text
Thesis -
17
Diagnosis of eyesight using Improved Clonal Selection Algorithm (ICLONALG) / Nor Khirda Masri
Published 2017“…This study aims to implement the classification algorithm using the Improved Clonal Selection Algorithm (ICLONALG) to classify the eyesight’s problems. …”
Get full text
Get full text
Thesis -
18
An enumerative algorithm for the maximum clique problem
Published 2019“…Partial enumerative algorithms are presented for maximum clique problems which are very easy to implement. …”
Get full text
Get full text
Conference or Workshop Item -
19
A hybrid algorithm for finding shortest path in network routing.
Published 2009“…This wave gives an O( N ) steps quantum algorithm for identifying that record, where was used classical Dijkstra’s algorithm for finding shortest path problem in the graph of network and implement quantum search. …”
Get full text
Article -
20
Parallel distributed genetic algorithm development based on microcontrollers framework
Published 2023“…This work is focused on the implementation of evolutionary based computer algorithms, genetic algorithms (GAs), on microcontrollers. …”
Conference paper