Search Results - (( basic optimization method algorithm ) OR ( based applications graph algorithm ))

Refine Results
  1. 1

    Particle swarm optimization (PSO) for CNC route problem by Nur Azia Azwani, Ismail

    Published 2002
    “…We often see many of the method of Genetic Algorithm (GA), Ant Colony Optimization (ACO), Simulated Annealing Algorithm (SAA) and PSO are used for any optimization problems. …”
    Get full text
    Get full text
    Undergraduates Project Papers
  2. 2
  3. 3

    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
    “…In this article, the researchers design an algorithm and apply it to a computer program (Python) to solve graph coloring and to visualize the variation of exam scheduling modeling at Binus University in graphs based on the Bitwise Graph Coloring Algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
  4. 4
  5. 5

    Optimal power flow based on fuzzy linear programming and modified Jaya algorithms by Alzihaymee, Warid Sayel Warid

    Published 2017
    “…Meanwhile, the proposed QOJaya algorithm produces better results than the basic Jaya method in terms of solution optimality and convergence speed. …”
    Get full text
    Get full text
    Thesis
  6. 6
  7. 7

    Voting algorithms for large scale fault-tolerant systems by Karimi, Abbas

    Published 2011
    “…To solve this problem and gain benefits of this algorithm, we employed parallel algorithm technique and by using optimal number of processors, we could propose optimal algorithms known as Parallel Average Voting and Parallel Weighted Average Voting which both have optimal time complexity and less calculation cost. …”
    Get full text
    Get full text
    Thesis
  8. 8
  9. 9
  10. 10

    IMPLEMENTATION OF GRAPH BASED PATH PLANNING ALGORITHMS FOR INDOOR NAVIGATION by SYED KHAIZURA, SYED HUSEIN KAMIL

    Published 2018
    “…In this study, we are looking at the performance of four graph-based path planning algorithms which is Breadth First Search, Depth First Search, Dijkstra and A*, when implemented in real world applications. …”
    Get full text
    Get full text
    Final Year Project
  11. 11

    VISUALIZATION OF GENETIC ALGORITHM BASED ON 2-D GRAPH TO ACCELERATE THE SEARCHING WITH HUMAN INTERVENTIONS. by FAROOQ, HUMERA

    Published 2012
    “…A tool termed as VIGA-20 (Visualization of Genetic Algorithm using 2-0 Graph) is implemented to accomplish this goal. …”
    Get full text
    Get full text
    Thesis
  12. 12
  13. 13

    Using Electromagnetism-like algorithm and genetic algorithm to optimize time of task scheduling for dual manipulators by Abed I.A., Sahari K.S.M., Koh S.P., Tiong S.K., Jagadeesh P.

    Published 2023
    “…A method based on Electromagnetism-Like algorithm (EM) and Genetic Algorithm (GA) is proposed to determine the time-optimal task scheduling for dual robot manipulators. …”
    Conference paper
  14. 14

    Improved Multi-Verse Optimizer In Text Document Clustering For Topic Extraction by Abasi, Ammar Kamal Mousa

    Published 2021
    “…Second, three multi-verse optimizer algorithm (MVOs), namely, basic MVO, modified MVO, hybrid MVO is proposed to solve the TDC problem; these algorithms are incremental improvements of the preceding versions. …”
    Get full text
    Get full text
    Thesis
  15. 15

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

    Published 1997
    “…After discussing about the introduction (the basic of CMOS transistor ), we will discuss how to create the Optimal layout of CMOS Functional Array with the minimum separation based on euler path method. …”
    Get full text
    Get full text
    Thesis
  16. 16

    Modeling of static and dynamic components of bio-nanorobotic systems by Gavgani, Hamidreza Khataee

    Published 2012
    “…Then, these graph-based structural models of the fullerenes and graph algorithms based on dynamic programming are applied to compute a new set of optimal weighted physical properties of the components including Wiener, hyper-Wiener, Harary and reciprocal Wiener indices as well as Hosoya and hyper-Hosoya polynomials. …”
    Get full text
    Get full text
    Thesis
  17. 17
  18. 18

    Max degree around (MDA) algorithm: a smart and efficient approximate algorithm for Vertex cover and independent set problems by Fayaz, Muhammad, Arshad, S, Shah, A.S, Shah, Asadullah

    Published 2016
    “…MVC and MIS are notable for its capability of modelling other combinatorial problems and real-world applications. The aim of this paper is twofold: first to investigate failures of the state-of- the-art algorithms for MVC problem on small graphs and second to propose a simple and efficient approximation algorithm for the minimum vertex cover problem. …”
    Get full text
    Get full text
    Get full text
    Article
  19. 19
  20. 20