Search Results - (( using simulation graph algorithm ) OR ( basic optimization bat algorithm ))

Search alternatives:

Refine Results
  1. 1
    A study on the parameter selection of bat algorithm in in optimizing parameters in camera auto calibration problem

    A study on the parameter selection of bat algorithm in in optimizing parameters in camera auto calibration problem by Mohd Said, Rahaini, A Aziz, Khairul Azha, Zainal Abidin, Amar Faiz, Mat Jizat, Jessnor Arif, Mohd Khairuddin, Ismail, Widiyanto, Sigit, Abdul Waduth, Mohamed Faisal

    Published 2022
    “…Each bat in the Bat Algorithm represents a potential solution to the issue, and each dimension in the Bat Algorithm's search space represents one of the basic parameters: skew, focal length, and magnification factor. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  2. 2
    Implementation of Graph Based Path Planning Algorithms on a Mobile Robot in a Confined Site

    Implementation of Graph Based Path Planning Algorithms on a Mobile Robot in a Confined Site by TANG, HON PANN

    Published 2017
    “…This project investigates the performance of three different graph based path planning algorithms used, relaxed A*, A* and Dijkstra’s algorithm in a few environments with different obstacles settings using Gazebo environment simulator and Turtlebot simulator (computer simulation) and 4WD navigation robot (real environment simulation).…”
    Get full text
    Get full text
    Final Year Project
    Save to List
    Saved in:
  3. 3
    Hexagon pattern particle swarm optimization based block matching algorithm for motion estimation / Siti Eshah Che Osman

    Hexagon pattern particle swarm optimization based block matching algorithm for motion estimation / Siti Eshah Che Osman by Che Osman, Siti Eshah

    Published 2019
    “…In future, this work could be enhanced for better performances in both aspects using another variant of the PSO or other potential metaheuristic searching techniques such as Firefly Optimization, Bat Algorithm and etc.…”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  4. 4
    Graph coloring program of exam scheduling modeling based on bitwise coloring algorithm using python

    Graph coloring program of exam scheduling modeling based on bitwise coloring algorithm using python by Arifin, Samsul, Muktyas, Indra Bayu, Al Maki, Wikky Fawwaz, Mohd Khairul Bazli, Mohd Aziz

    Published 2022
    “…The researchers develop a graph coloring algorithm by considering some of the graph vertices to be binary numbers. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  5. 5
    An improved algorithm for channel allocation on direct sequence spread spectrum

    An improved algorithm for channel allocation on direct sequence spread spectrum by Handrizal, M

    Published 2011
    “…Graph coloring is a useful algorithm for channel allocation on Direct Sequence Spread Spectrum (DSSS).Through this algorithm,each access point (AP) that adjacent gives different channels based on colors available.Welsh Powell algorithm and Degree of saturation (Dsatur) are the popular algorithms being used for channel allocation in this domain. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  6. 6
    Design and analysis of DNA fragment assembly's converter and checker modules using De Bruijin Graph / Mohd Shafiq Mohd Helmi

    Design and analysis of DNA fragment assembly's converter and checker modules using De Bruijin Graph / Mohd Shafiq Mohd Helmi by Mohd Helmi, Mohd Shafiq

    Published 2012
    “…The algorithm used to construct the module is Bruijn Graph. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  7. 7
    Design and analysis of DNA fragment assembly's converter and checker modules using De Bruijin Graph : article / Mohd Shafiq Mohd Helmi

    Design and analysis of DNA fragment assembly's converter and checker modules using De Bruijin Graph : article / Mohd Shafiq Mohd Helmi by Mohd Helmi, Mohd Shafiq

    Published 2012
    “…The algorithm used to construct the module is Bruijn Graph. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  8. 8
    Application of computer based simulation in gas network system using graph theory algorithms and numerical methods

    Application of computer based simulation in gas network system using graph theory algorithms and numerical methods by Poh, Hong Hwee

    Published 2007
    “…This is causing the other graph theory algorithms remain least known to users. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    Solving the minimum dominating set problem of partitioned graphs using a hybrid bat algorithm

    Solving the minimum dominating set problem of partitioned graphs using a hybrid bat algorithm by Abed, S.A., Rais, H.M.

    Published 2020
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    Novel Multi-swarm Approach for Balancing Exploration and Exploitation in Particle Swarm Optimization

    Novel Multi-swarm Approach for Balancing Exploration and Exploitation in Particle Swarm Optimization by Salih, Sinan Q., Alsewari, Abdulrahman A., Al-Khateeb, Bellal, Mohamad Fadli, Zolkipli

    Published 2019
    Get full text
    Get full text
    Get full text
    Book Chapter
    Save to List
    Saved in:
  11. 11
    Laser simulator: a novel search graph-based path planning approach

    Laser simulator: a novel search graph-based path planning approach by Ali, Mohammed A. H., Musa, Mailah

    Published 2018
    “…In addition, a comparative study on the laser simulator approach, A* algorithm, Voronoi diagram with fast marching and PointBug algorithms was performed to show the benefits and drawbacks of the proposed approach. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    A hybrid algorithm for finding shortest path in network routing.

    A hybrid algorithm for finding shortest path in network routing. by Soltan Aghaei, Mohammad Reza, Ahmad Zulkarnain, Zuriati, Mamat, Ali, Zainuddin, Hishamuddin

    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
    Save to List
    Saved in:
  13. 13
    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
    “…The African Buffalo Optimization (A.B.0) algorithm simulates the African buffalos' behaviour by encapsulation in a mathematical model; which solves a number of discrete optimization problems using graph-based route planning, job scheduling and it extends Swarm Intelligence paradigms. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    An Improved of Channel Allocation for WLAN Using Vertex Merge Algorithm

    An Improved of Channel Allocation for WLAN Using Vertex Merge Algorithm by Mr, Handrizal, Mr, Muhammad Zarlis, Noraziah, Ahmad, Abdalla, Ahmed N.

    Published 2012
    “…Graph colouring is a useful algorithm for channel allocation on wireless local area network (WLAN). …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  15. 15
    Scalable workflow scheduling algorithm for minimizing makespan and failure probability

    Scalable workflow scheduling algorithm for minimizing makespan and failure probability by Abdul Aziz, Maslina, Ninggal, Izuan Hafez

    Published 2019
    “…A simulation-driven analysis based on realistic workflow application was demonstrated using DAG graph as a continuation of the Layered Workflow Scheduling Algorithm (LWFS). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    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
    “…Both algorithms are compared. Simulation is used as a method in this study. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    Spanning Tree Transformation of Connected Graph into Single-Row Network

    Spanning Tree Transformation of Connected Graph into Single-Row Network by Loh, Ser Lee, Salleh, Shaharuddin, Sarmin, Nor Haniza

    Published 2010
    “…Finally, the single-row routing problem is solved using a method called Enhanced Simulated Annealing for Single-Row Routing (ESSR).…”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  18. 18
    Efficient signaling schedule for centralized and distributed scheduling algorithms for wimax multi-hop relay networks

    Efficient signaling schedule for centralized and distributed scheduling algorithms for wimax multi-hop relay networks by Saqer, Ahmad Sabri Mousa

    Published 2012
    “…In order to evaluate the proposed algorithms and validate their efficiency for IEEE 802.16j networks, the authors simulated the algorithms in QualNet simulator. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  19. 19
    A branch and bound and simulated annealing approach for job shop scheduling

    A branch and bound and simulated annealing approach for job shop scheduling by Tan, Hui Woon, Salim, Sutinah

    Published 2004
    “…In the branch and bound approach, the job shop scheduling problem is represented by a disjunctive graph, then the optimal schedule is obtained using the branch and bound algorithm while simulated annealing is a local search based algorithm which will slightly perturb the initial feasible solution to decrease the makespan. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    Quantum Processing Framework And Hybrid Algorithms For Routing Problems

    Quantum Processing Framework And Hybrid Algorithms For Routing Problems by Soltan Aghaei, Mohammad Reza

    Published 2010
    “…The designed hybrid architecture and framework were tested using the above quantum algorithms and the existing quantum algorithms. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: