Search Results - (((( optimal graph algorithm ) OR ( optimal _ algorithm ))) OR ( optimal code algorithm ))

Refine Results
  1. 1

    Approximate methods for minimum vertex cover fail to provide optimal results on small graph instances: A review by Fayaz, Muhammad, Arshad, Shakeel, Shah, Abdul Salam, Shah, Asadullah

    Published 2018
    “…The key contribution of this paper is the provision of small benchmark graphs on which the given approximation algorithms fail to provide optimal results. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  2. 2

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

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

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

    Software regression test case prioritization for object-oriented programs using genetic algorithm with reduced-fitness severity by Musa, Samaila, Md Sultan, Abu Bakar, Abd Ghani, Abdul Azim, Baharom, Salmi

    Published 2015
    “…This paper propose an optimized regression test case selection and prioritization for object-oriented software based on dependence graph model analysis of the source code and optimized the selected test case using Genetic Algorithm. …”
    Get full text
    Get full text
    Conference or Workshop Item
  6. 6

    Implementation of locust inspired scheduling algorithm with huge number of servers for energy efficiency in a cloud datacenter by Azhar, Nur Huwaina

    Published 2019
    “…LACE algorithm is used to schedule and optimize Virtual Machine (VMs) allocation across the servers according to behaviour obtained from locust nature. …”
    Get full text
    Get full text
    Thesis
  7. 7

    A genetic algorithm to minimise the maximum lateness on a single machine family scheduling problem by Lee, Lai Soon, Nazif, Habibeh

    Published 2009
    “…All algorithms are coded in ANSI-C using Microsoft Visual C++ 6.0 as the compiler, and run on a Pentium 4, 2.0 GHz computer with 2.0 GB RAM. …”
    Get full text
    Conference or Workshop Item
  8. 8

    Regression test case selection & prioritization using dependence graph and genetic algorithm by Musa, Samaila, Md Sultan, Abu Bakar, Abd Ghani, Abdul Azim, Baharom, Salmi

    Published 2014
    “…The approach is based on optimization of selected test case from dependency analysis of the source codes. …”
    Get full text
    Get full text
    Article
  9. 9

    Using genetic algorithms to optimise land use suitability by Pormanafi, Saeid

    Published 2012
    “…Second task is to determine the fitness function for the genetic algorithms. The third objective is to optimize the land use map using economic benefits. …”
    Get full text
    Get full text
    Thesis
  10. 10

    DeMI interface tool for profit estimation and waste conversion technology recommendations in enhancing municipal solid waste management by Ali, R.A., Nik Ibrahim, N.N.L., Ghani, W.A.W.A.K., Sani, N.S., Lam, H.L.

    Published 2024
    “…Leveraging the accelerated branch-and-bound algorithm, the P-graph efficiently generates optimal structures capable of accommodating diverse complexities, thus ensuring adaptability in synthesising process configurations. …”
    Get full text
    Get full text
    Get full text
    Article
  11. 11
  12. 12

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

    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
    “…This study meticulously evaluates each algorithm’s computational efficiency, implementation complexity, and performance in generating optimal routes.…”
    Get full text
    Get full text
    Thesis
  14. 14

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

    Optimizing boarding school schedule using graph colouring : case study of Sekolah Menengah Sultan Abdul Halim / Nur Farhana Mohd Asri by Mohd Asri, Nur Farhana

    Published 2021
    “…In order to achieve this goal, the school schedule has been optimized using the Graph Coloring method. In this study, two approaches have been used under the Graph Coloring method which is Vertex and Edge Coloring and both of it have been solved by implementing the specific algorithm in it. …”
    Get full text
    Get full text
    Student Project
  16. 16

    Optimizing boarding school schedule using graph coloring: case study of Sekolah Menengah Sultan Abdul Halim / Nur Farhana Mohd Asri by Mohd Asri, Nur Farhana

    Published 2022
    “…In order to achieve this goal, the school schedule has been optimized using the Graph Coloring method. In this study, two approaches have been used under the Graph Coloring method which is Vertex and Edge Coloring and both of it have been solved by implementing the specific algorithm in it. …”
    Get full text
    Get full text
    Research Reports
  17. 17
  18. 18

    An optimal approximation algorithm for optimization of un-weighted minimum vertex cover problem by Fayaz, Muhammad, Arshad, S, Shah, Abdul Salam, Shah, Asadullah

    Published 2016
    “…Mean of Neighbors of Minimum Degree Algorithm (MNMA) is proposed in this paper. The MNMA produces optimal or near optimal vertex cover for any known undirected, un-weighted graph. …”
    Get full text
    Get full text
    Get full text
    Article
  19. 19

    A Real-Coded Dynamic Genetic Algorithm For Optimizing Driver’s Model In Emission Test Cycle by Zeratul Izzah, Mohd Yusoh, Hisashi, Tamaki, Kazuhide, Togai

    Published 2015
    “…This paper proposes a real-coded Genetic Algorithm for finding optimal parameters’ values of a driver’s model. …”
    Get full text
    Get full text
    Get full text
    Article
  20. 20

    Ant colony optimization algorithm for load balancing in grid computing by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

    Published 2012
    “…The proposed algorithm is known as the enhance ant colony optimization (EACO). …”
    Get full text
    Get full text
    Get full text
    Monograph