Search Results - (( using optimization method algorithm ) OR ( using simple path algorithm ))*

Refine Results
  1. 1
  2. 2

    Optimizing optimal path trace back for Smith-Waterman algorithm using structural modelling technique by Saliman, Nur Farah Ain

    Published 2012
    “…The optimizing of optimal path trace back system for Smith-Waterman algorithm using structural modelling techniques are presented in this paper. …”
    Get full text
    Get full text
    Student Project
  3. 3

    Optimizing optimal path trace back system for Smith-Waterman algorithm using structural modelling technique: article by Saliman, Nur Farah Ain

    Published 2012
    “…back system for Smith-Waterman Algorithm using Structural Modelling Technique. The objectives for this paper are to optimize the best trace back scanning performance and also to design the simple architecture in order to reduce the runtime. …”
    Get full text
    Get full text
    Article
  4. 4

    A generalized laser simulator algorithm for optimal path planning in constraints environment by Aisha, Muhammad

    Published 2022
    “…A statistical test was used to demonstrate the efficiency of the proposed algorithm over the compared methods. …”
    Get full text
    Thesis
  5. 5

    Finding minimum path by using Genetic Algorithm (GA)/ Siti Zuraifah Hashim by Hashim, Siti Zuraifah

    Published 2007
    “…It makes use of three basic operations in order to optimize this problem. …”
    Get full text
    Get full text
    Thesis
  6. 6

    Optimization Of Two-Dimensional Dual Beam Scanning System Using Genetic Algorithms by Koh, Johnny Siaw Paw

    Published 2008
    “…This thesis presents a new approach to optimize the performance of a dual beam optical scanning system in terms of its scanning combinations and speed, using Genetic Algorithm (GA). …”
    Get full text
    Get full text
    Thesis
  7. 7

    A comparative study of heuristic methods to solve Traveling Salesman Problem (TPS) by Lim, Yai Fung, Hong, Pei Yee, Ramli, Razamin, Khalid, Ruzelan

    Published 2011
    “…Traveling Salesman Problem (TSP) is a famous problem in combinatorial optimization. The objective of the TSP is to find the shortest path that reaches all the cities which are interconnected with each other by straight lines.The symmetric TSP is used and the distance between two cities is calculated by using Euclidean equation.In this study, three heuristic methods, namely simulated annealing (SA), tabu search (TS) and reactive tabu search (RTS) are used to solve TSP.SA is a generic probabilistic meta-algorithm for the global optimization problem and TS is a meta-heuristic search technique that guides a local search procedure to explore the solution space beyond local optimality. …”
    Get full text
    Get full text
    Get full text
    Monograph
  8. 8

    Modeling and multi-objective optimal sizing of standalone photovoltaic system based on evolutionary algorithms by Ridha, Hussein Mohammed

    Published 2020
    “…The IEM algorithm uses the attraction-repulsion mechanism to change the positions of solutions towards the optimality. …”
    Get full text
    Get full text
    Thesis
  9. 9

    The solution of 2048 puzzle game using A* algorithm / Zafhira Ismail by Ismail, Zafhira

    Published 2017
    “…The input data of this project is retrieved from the game’s rule itself and implemented with the proposed algorithm which is A* algorithm. The output of this project is the best solution to achieve the goal using A* algorithm. …”
    Get full text
    Get full text
    Thesis
  10. 10

    Design, development and performance optimization of a new artificial intelligent controlled multiple-beam optical scanning module by Koh J.S.P., Aris I.B., Ramachandaramurthy V.K., Bashi S.M., Marhaban M.H.

    Published 2023
    “…This research presents a new approach to optimise the performance of a multiple-beam optical scanning system in terms of its marking combinations and speed, using Genetic Algorithm (GA). The problem has been decomposed into two sub problems; task segregation, where the marking tasks need to be segregated and assigned for each scanner head and path planning where the best combinatorial paths for each scanner are determined in order to minimise the total motion of marking time. …”
    Article
  11. 11

    Design, development and performance optimization of a new artificial intelligent controlled multiple-beam optical scanning module by Koh J.S.P., Aris I.B., Ramachandaramurthy V.K., Bashi S.M., Marhaban M.H.

    Published 2023
    “…This research presents a new approach to optimise the performance of a multiple-beam optical scanning system in terms of its marking combinations and speed, using Genetic Algorithm (GA). The problem has been decomposed into two sub problems; task segregation, where the marking tasks need to be segregated and assigned for each scanner head and path planning where the best combinatorial paths for each scanner are determined in order to minimise the total motion of marking time. …”
    Article
  12. 12

    Robotic path planning using rapidly-exploring random trees by Sherwani, Fahad

    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
  13. 13

    Design, development and performance optimization of a new artificial intelligent controlled multiple-beam optical scanning module by Koh, Johnny Siaw Paw, Aris, Ishak, Ramachandaramurthy, Vigna Kumaran, Bashi, Sinan Mahmod, Marhaban, Mohammad Hamiruce

    Published 2006
    “…This research presents a new approach to optimise the performance of a multiple-beam optical scanning system in terms of its marking combinations and speed, using Genetic Algorithm (GA). The problem has been decomposed into two sub problems; task segregation, where the marking tasks need to be segregated and assigned for each scanner head and path planning where the best combinatorial paths for each scanner are determined in order to minimise the total motion of marking time. …”
    Get full text
    Get full text
    Get full text
    Article
  14. 14

    Hybrid genetic algorithm with multi-parents recombination for job shop scheduling problems / Ong Chung Sin by 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
  15. 15

    Modeling and control of a Pico-satellite attitude using Fuzzy Logic Controller by Zaridah, Mat Zain

    Published 2010
    “…In this regards, a new method of Pico-satellite attitude control using Mamdani Fuzzy Logic Principles is introduced. …”
    Get full text
    Thesis
  16. 16

    Modeling of cardiovascular diseases (CVDs) and development of predictive heart risk score by Mirza Rizwan, Sajid

    Published 2021
    “…Further, it focuses on the development of various forms of local risk prediction models and simple heart risk scores using non-laboratory features and machine learning (ML) algorithms. …”
    Get full text
    Get full text
    Thesis
  17. 17

    Comparison of path planning in simulated robot by Ch’ng, Chee Yu’ng

    Published 2020
    “…There are 4 path planning algorithms will be compared, which are Dijkstra’s algorithm, A* algorithm, RapidExploring Random Tree (RRT) algorithm, and the last one is an algorithm modified from A*. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  18. 18

    Computer algorithm for playing checkers by Chua Shin Lee

    Published 2023
    “…The Checkers game uses heuristics algorithm, a simple depth-first procedure, for searching trees.…”
    text::Thesis
  19. 19

    The performance effect due to varying network topologies on a software-defined network employing the k-shortest path by Linsheng, R., Derahman, M. N., Kadir, M. F. A., Mohamed, M. A., Kamarudin, S.

    Published 2022
    “…K-shortest paths algorithm discovers a set of paths ordered in the most optimal, optimal, and suboptimal, has a very wide application is integrated into SDN controller to handle routing functionality. …”
    Get full text
    Get full text
    Article
  20. 20

    Multi-Robot Path-Planning algorithm for automated parcel sorting centre with ring road layout by Jong, Qian Biao

    Published 2023
    “…Since the automated warehouses and sorting centres are usually large and contain hundreds of robots, the recent algorithms with the simple grid layout assumption are doubted to be efficient in the real world. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis