Search Results - (( using computational path algorithm ) OR ( sequence optimization based algorithm ))
Search alternatives:
- computational path »
- path algorithm »
-
1
An enhanced swap sequence-based particle swarm optimization algorithm to solve TSP
Published 2021“…To improve the performance of the swap sequence based PSO, this paper introduces an Enhanced Swap Sequence based PSO (Enhanced SSPSO) algorithm by integrating the strategies of the Expanded PSO (XPSO) in the swap sequence based PSO. …”
Get full text
Get full text
Get full text
Get full text
Get full text
Article -
2
Design and analysis of sequence generator module using eulerian path algorithm for DNA fragment assembly: article / Mustaqim Mohd Subri
Published 2013“…This project is designed based on speed optimization. DNA fragment assembly is a process reassembling fragment of DNA like a puzzle into several other sequence. …”
Get full text
Get full text
Article -
3
Design and analysis of sequence generator module using eulerian path algorithm for DNA fragment assembly / Mustaqim Mohd Subri
Published 2013“…This project is designed based on speed optimization. DNA fragment assembly is a process to reassemble DNA fragments into several others sequence similar to the process of completing a puzzle. …”
Get full text
Get full text
Student Project -
4
Optimization Of Two-Dimensional Dual Beam Scanning System Using Genetic Algorithms
Published 2008“…Also, this research involves in developing a machine-learning system and program via genetic algorithm that is capable of performing independent learning capability and optimization for scanning sequence using novel GA operators. …”
Get full text
Get full text
Thesis -
5
Simulated kalman filter with modified measurement, substitution mutation and hamming distance calculation for solving traveling salesman problem
Published 2022“…Most metaheuristic algorithms are designed for continuous optimization problem. …”
Get full text
Get full text
Get full text
Get full text
Conference or Workshop Item -
6
DNA sequence design for direct-proportional length-based DNA computing: Particle swarm optimization vs population based ant colony optimization
Published 2012“…Previously, direct-proportional length-based DNA computing which involved DNA sequences with different lengths has been implemented to solve the shortest path problem. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
7
Hybrid multiobjective genetic algorithm for integrated dynamic scheduling and routing of jobs and automated guided vehicles in flexible manufacturing systems
Published 2014“…The algorithm used weight mapping crossover (WMX) and Insertion Mutation (IM) as genetic operators for sub-chromosomes represented with priority-based representation. …”
Get full text
Get full text
Thesis -
8
Routing problem in rectangular mesh network using shortest path based Greedy method
Published 2019“…Therefore, developing a shortest path based routing algorithm is in need. In this research, Dijkstra's algorithm is used to establish the shortest connection for each net. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
9
Routing problem in rectangular mesh network using shortest path based Greedy method
Published 2019“…Therefore, developing a shortest path based routing algorithm is in need. In this research, Dijkstra's algorithm is used to establish the shortest connection for each net. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
10
Estimation of Transformers Health Index Based on Condition Parameter Factor and Hidden Markov Model
Published 2023Conference Paper -
11
Design of DNA fragment assembly using IWP method on application-specific integrated-circuit / Hasniliati Hassan
Published 2017“…Depending on the technology used, it can only read small pieces of base between 20 to 1000 bases. …”
Get full text
Get full text
Thesis -
12
Hybrid genetic algorithm with multi-parents recombination for job shop scheduling problems / Ong Chung Sin
Published 2013“…This mechanism is restricted to search the possible solutions in a critical path. Modification on the path by using neighborhood search significantly reduces the total length of the makespan. …”
Get full text
Get full text
Get full text
Thesis -
13
Examining the round trip time and packet length effect on window size by using the Cuckoo search algorithm
Published 2016“…This signifies that the training was successful based on the fitted values of the window size. Thus the proposed model trained with the CS algorithm provides a high convergence rate to the true global minimum and a better optimal solution. …”
Get full text
Get full text
Get full text
Get full text
Article -
14
Dynamic transmit antenna shuffling scheme for hybrid multiple-input multiple-output in layered architecture
Published 2010“…It is shown that the computational complexity of proposed FAST-QR detection algorithm is approximately 48 % lower than the conventional QR decomposition detection algorithm. …”
Get full text
Get full text
Thesis -
15
Comparative Analysis of Low Discrepancy Sequence-Based Initialization Approaches Using Population-Based Algorithms for Solving the Global Optimization Problems
Published 2021“…These algorithms can influence the convergence to find an efficient optimal solution. …”
Get full text
Get full text
Get full text
Get full text
Get full text
Article -
16
Product assembly and disassembly sequence optimization based on genetic algorithm and design for assembly methodologies
Published 2009“…In this paper, an Artificial Intelligence (AI) technique, namely Genetic Algorithm (GA) is proposed to optimize product components assembly and disassembly sequences.The proposed methodology is developed and tested on an industrial product made of plastics with no integrated assembly and permanent joint parts.GA method is applied to determine the accuracy and optimum results based on 20 assembly and disassembly sequence solutions that was generated by the Design for Assembly methodology.The results indicated that GA based approach is able to obtain a near optimal solution for assembly and disassembly sequences.…”
Get full text
Get full text
Get full text
Conference or Workshop Item -
17
A filtering algorithm for efficient retrieving of DNA sequence
Published 2009“…The algorithm filtered the expected irrelevant DNA sequences in database from being computed for dynamic programming based optimal alignment process. …”
Get full text
Get full text
Get full text
Article -
18
Product assembly sequence optimization based on genetic algorithm
Published 2010“…Genetic algorithm (GA) is a search technique used in computing to find approximate solution to optimization and search problem based on the theory of natural selection. …”
Get full text
Get full text
Get full text
Article -
19
Efficient Entropy-Based Decoding Algorithms For Higher-Order Hidden Markov Model
Published 2019“…The required memory of this algorithm is also time independent. In addition, the optimal state sequence obtained by the EVRA algorithm is the same as that obtained by the classical Viterbi algorithm for HHMM.…”
Get full text
Get full text
Thesis -
20
Sequence t-way test generation using the barnacles mating optimizer algorithm
Published 2021“…More precisely, we focus on the generation of test cases due to the ordering of inputs (or sequence) using the newly developed Barnacles Mating Optimizer (BMO) Algorithm. …”
Get full text
Get full text
Get full text
Get full text
Conference or Workshop Item
