Search Results - optimal ((((((tree algorithm) OR (graph algorithm))) OR (_ algorithm))) OR (path algorithm))

Search alternatives:

Refine Results
  1. 1
    Guidance system based on Dijkstra-ant colony algorithm with binary search tree for indoor parking system

    Guidance system based on Dijkstra-ant colony algorithm with binary search tree for indoor parking system by Mohammad Ata, Karimeh Ibrahim, Che Soh, Azura, Ishak, Asnor Juraiza, Jaafar, Haslina

    Published 2021
    “…This solution depending on applying the optimization on an optimal path while the traditional ACO is optimizing the random path based on the greedy algorithm hence we get the most optimal path. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  2. 2
    Synthesis of transistor-chaining algorithm for CMOS cell layout using bipartite graph / Azizi Misnan

    Synthesis of transistor-chaining algorithm for CMOS cell layout using bipartite graph / Azizi Misnan by Misnan, Azizi

    Published 1997
    “…Searching for possible abutment between the transistor pairs are modelled as a bipartite graph. A depth - first search algorithm is used to search for optimal chaining. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  3. 3
    Synthesis of transistor chaining algorithm for CMOS cell layout using bipartite graph / Azizi Misnan

    Synthesis of transistor chaining algorithm for CMOS cell layout using bipartite graph / Azizi Misnan by Misnan, Azizi

    Published 1997
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  4. 4
    A comparative analysis of Prim, Kruskal, and Reverse-Delete algorithms in optimizing routes within Terengganu’s and Pahang’s attraction road network / Munashahira Mohammad Zahid

    A comparative analysis of Prim, Kruskal, and Reverse-Delete algorithms in optimizing routes within Terengganu’s and Pahang’s attraction road network / Munashahira Mohammad Zahid by Mohammad Zahid, Munashahira

    Published 2024
    “…The Reverse-Delete algorithm works in reverse; it starts with the full graph and iteratively removes the largest edges, ensuring that the graph remains connected. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    Path Optimization For Cooperative Multi-Head 3d Printing

    Path Optimization For Cooperative Multi-Head 3d Printing by Cheong, Kah Jun

    Published 2020
    “…Hence, finding the best path for the nozzle is termed as the Layer Path Optimization Problem (LPOP). …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
    Save to List
    Saved in:
  6. 6
    Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator: article

    Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator: article by Othman, Nor Shuhaida

    Published 2010
    “…The Smith-Waterman is been simplified into four modules which were initialization, score calculation, matrix filling and optimal path. The scope of the paper based on optimal path trace back using graph theory. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  7. 7
    Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator

    Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator by Othman, Nor Shuhaida

    Published 2010
    “…The Smith-Waterman is been simplified into four modules which were initialization, score calculation, matrix filling and optimal path. The scope of the paper based on optimal path trace back using graph theory. …”
    Get full text
    Get full text
    Student Project
    Save to List
    Saved in:
  8. 8
    Route optimization using shortest path method / Muhamad Faisal Amin Shakri

    Route optimization using shortest path method / Muhamad Faisal Amin Shakri by Shakri, Muhamad Faisal Amin

    Published 2025
    “…Each algorithm was tested to compute the shortest path, with results indicating that while all algorithms arrive at the same optimal route, their efficiency differs. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    African Buffalo Optimization (ABO): A New Metaheuristic Algorithm

    African Buffalo Optimization (ABO): A New Metaheuristic Algorithm by Odili, Julius Beneoluchi, M. N. M., Kahar

    Published 2015
    “…When compared to the Ant Colony Optimization algorithm, Simulated Annealing and Genetic Algorithm, the results obtained from African Buffalo Optimization show that the algorithm works well and can be extended to solving problems like: path planning, scheduling, vehicle routing in addition to other constraint-driven problems.…”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    Synthesis of transistor chaining algorithm for CMOS cell layout using euler path / Sukri Hanafiah

    Synthesis of transistor chaining algorithm for CMOS cell layout using euler path / Sukri Hanafiah by Hanafiah, Sukri

    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
    Save to List
    Saved in:
  11. 11
    High Rise Building Evacuation Route Model Using DIJKSTRA'S Algorithm

    High Rise Building Evacuation Route Model Using DIJKSTRA'S Algorithm by Mohd Sabri, Nor Amalina

    Published 2015
    “…The information then is used to generate a directed graph in order to obtain the shortest path results through the implementation of shortest path algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  12. 12
    Attack path selection optimization with adaptive genetic algorithms

    Attack path selection optimization with adaptive genetic algorithms by Abd Rahman, A.S., Zakaria, M.N., Masrom, S.

    Published 2016
    “…We describe our approach for implementing an optimized security assessment using Genetic Algorithm (GA). …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  13. 13
    Attack path selection optimization with adaptive genetic algorithms

    Attack path selection optimization with adaptive genetic algorithms by Abd Rahman, A.S., Zakaria, M.N., Masrom, S.

    Published 2016
    “…We describe our approach for implementing an optimized security assessment using Genetic Algorithm (GA). …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    An Experiment of Ant Algorithms : Case Study of Kota Kinabalu Central Town

    An Experiment of Ant Algorithms : Case Study of Kota Kinabalu Central Town by Nor Rafidah, Mohamad

    Published 2005
    “…There are many algorithms that used to solve this problem. In this study, ant algorithms are used to find the shortest path using a real data. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    Optimization of mobile robot path planning in semi-dynamic environment using genetic algorithm

    Optimization of mobile robot path planning in semi-dynamic environment using genetic algorithm by Kasim Hawari, Mohd Zarifitri

    Published 2023
    “…Finally, the simulation was conducted by implementing a random algorithm to verify the proposed GA in terms of the mobile robot's minimum and maximum path lengths. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    Path planning algorithm for a car-like robot based on cell decomposition method

    Path planning algorithm for a car-like robot based on cell decomposition method by Omar, Nurhanum

    Published 2013
    “…Then, the connectivity graph is created followed by calculating the shortest path by Dijkstra’s algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    Robot manipulator minimum jerk trajectory planning based on the improved dung Beetle Optimizer Algorithm

    Robot manipulator minimum jerk trajectory planning based on the improved dung Beetle Optimizer Algorithm by Ma, Haohao, As’arry, Azizan, Cong, Miaomiao, Delgoshaei, Aidin, Ismail, Mohd Idris Shah, Ramli, Hafiz Rashidi, Wu, Xuping

    Published 2024
    “…This paper discusses different algorithms and finally proposes a fusion of the improved Dung Beetle Optimizer (IDBO) algorithm using chaotic mapping, sinusoidal random mutation, and nonlinear convergence strategies with the bidirectional Rapidly exploring Random Tree (RRT) algorithm to achieve manipulator trajectory planning and minimum jerk optimization trajectory. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    Using graph algorithm and classification technique for finding an optimal bus route in time-dependent travel times

    Using graph algorithm and classification technique for finding an optimal bus route in time-dependent travel times by Deelertmongkolchai, Satjayod, Chumwatana, Todsanai, Thaiupathump, Choonhapong

    Published 2016
    “…However, they are suffering from the long hours in traffic jam especially in rush hour.They also cannot avoid this such jam as bus routes are fixed by Bangkok Mass Transit Authority (BMTA).This paper aims to propose a technique for finding an Optimal Bus Route in Time-Dependent Travel Times by using graph algorithm and data mining technique. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  19. 19
    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization

    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

    Published 2019
    “…BST inserts the nodes in the way that the Dijkstra’s can find the empty parking in fastest way. Dijkstra’s algorithm initials the paths to finding the shortest path while ACO optimizes the paths. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    Test case minimization applying firefly algorithm

    Test case minimization applying firefly algorithm by Hashim, Nor Laily, Dawood, Yasir Salman

    Published 2018
    “…The proposed test case minimization method has the following steps: provide weight to the paths, calculate path coverage for each path, transform an immediate graph into an adjacency matrix, which later is used to apply firefly algorithm and generate optimal test cases. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: