Search Results - (( java application pollination algorithm ) OR ( construct sequence optimization algorithm ))
Search alternatives:
-
1
Design and analysis of construction and recombination module using Idury Waterman Algorithm for fragment assembly application / Hafifi Mohd Rafi
Published 2012“…This algorithm will be implemented on the Xilinx ISE 12.4 software to model the sequence and optimize the last sequence of DNA. …”
Get full text
Get full text
Thesis -
2
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 -
3
Ant colony optimization based subset feature selection in speech processing: Constructing graphs with degree sequences
Published 2024journal::journal article -
4
-
5
-
6
-
7
Design and analysis of DNA sequence alignment module using Smith-Waterman scoring patterns / Wan Abdul Qayyum Moh Salleh
Published 2013“…The system optimizes the aligning DNA fragment using Smith-Waterman algorithm with a pattern recognition algorithm. …”
Get full text
Get full text
Student Project -
8
Design and analysis of DNA sequence alignment module using Smith-Waterman scoring pattern: article / Wan Abdul Qayyum Moh Salleh and A.K. Halim
Published 2013“…The system optimizes the aligning DNA fragment using Smith-Waterman algorithm with a pattern recognition algorithm. …”
Get full text
Get full text
Article -
9
Hybrid optimal path traceback system development for optimization DNA sequences alignment
Published 2012Get full text
Get full text
Student Project -
10
-
11
Makespan algorithms and heuristic for internet-based collaborative manufacturing process using bottleneck approach
Published 2010“…It was shown that using bottleneck-based analysis, effective makespan algorithms and constructive heuristic can be developed to solve for near-optimal scheduling sequence. …”
Get full text
Get full text
Get full text
Article -
12
Computational methods for self-assembly of DNA nanostructures / Ong Hui San
Published 2016“…Several approaches have been adopted including development of an autonomous tool that incorporated evolutionary optimization algorithm in constructing these heterogeneous DNA shapes and the application of heuristic through undirected graph theory as an annotation schema to produce the connectivity maps. …”
Get full text
Get full text
Thesis -
13
An application of Floyd-Warshall Algortihm in finding shortest path of order picker in warehouse / Saidatul Aisyah Roslan, Siti Norhakimah Mohd Yatim and Siti Sarah Sulaiman
Published 2019“…The objectives of this study are to construct the distance matrix and sequence matrix based on the network layout and to find the shortest path to collect the item in the warehouse. …”
Get full text
Get full text
Student Project -
14
Design and analysis of 4x4 Smith Waterman’s based DNA sequences alignment accelerator using multicore architecture: article
Published 2011“…The third objective is to construct modules that consist of 2, 4 and 8 cores. …”
Get full text
Get full text
Article -
15
Ant system with heuristics for capacitated vehicle routing problem
Published 2013“…Specifically, the proposed methodology in this study is called Ant System with Heuristics (ASH) and it was developed based on the first ACO metaheuristic, known as Ant System (AS). The ASH algorithm is basically applied with its probabilistic decision rule and pheromone feedback to construct the sequences of customers to be visited in the CVRP solution. …”
Get full text
Get full text
Thesis -
16
A neural network modal decomposition mechanism in predicting network traffic
Published 2023“…The proposed mechanism starts by using SABC to update the model with a new solution and fine-tune the disturbances in each iteration to deal with the interference in order to find the best values that are also synchronously optimal. The SAVE-AS then constructs an adaptive selection operator. …”
Get full text
Get full text
Get full text
Thesis -
17
Methodology to develop heuristic for re-entrant flow shop with two potential dominant machines using bottleneck approach
Published 2012“…Using these correction factors, a constructive heuristic was developed to solve for near-optimal scheduling sequence. …”
Get full text
Get full text
Article -
18
Ant colony optimization for container loading problem.
Published 2012“…In the first phase, ACO with its probabilistic decision rule was used to construct a sequence of boxes. The boxes were then arranged into a container with the tower building heuristic in the second phase. …”
Get full text
Get full text
Article -
19
Design and analysis of low power sequence generator module for DNA fragment assembly: article / Nurul Amalina Abu Seman
Published 2013“…The objectives of this project are to construct DNA Fragment Assembly module using Euler algorithm and optimize power consumption of the module. …”
Get full text
Get full text
Article -
20
Evacuation routing optimizer (EROP) / Azlinah Mohamed … [et al.]
Published 2011“…With these solutions, the evacuation routing optimizer (EROP) is constructed. The EVAP is firstly solved, followed by the EVRP. …”
Get full text
Get full text
Research Reports