Search Results - (( optimal graph algorithm ) OR ( optimal drops algorithm ))

Search alternatives:

Refine Results
  1. 1
    Analysis and modeling of database storage optimization power consumption usage for green data centers

    Analysis and modeling of database storage optimization power consumption usage for green data centers by Wan Noor Hamiza, Wan Ali

    Published 2014
    “…The proxies can be discovered by using a developed algorithm of functional dependencies (FDs) called as TANE algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  2. 2
    Benchmark simulator with dynamic environment for job scheduling in grid computing

    Benchmark simulator with dynamic environment for job scheduling in grid computing by Ku-Mahamud, Ku Ruhana

    Published 2014
    “…Characteristics of jobs and resources to be used in evaluating the performance of the scheduling algorithm must reflect the dynamic nature of real grid environment.Static models of jobs and resources cannot be used to generate jobs and resources in simulating the grid environment because of the dynamic nature of the grid.This paper presents a new graph representation of jobs and resources which is practical for hybrid metaheuristic model implementation such as ant colony optimization and genetic algorithm.A dynamic model that can generate jobs and resources similar to the jobs and resources in the real grid environment is also proposed.Jobs and resources may join in or drop out from the grid.Stochastic analysis is performed on the characteristics of jobs and resources.A simulator based on the dynamic expected time to compute, has been developed and can be used as a benchmark.The simulator can generate jobs and resources with the characteristics of jobs and resources in the real grid environment.This will facilitates the evaluation of dynamic job scheduling algorithm.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  3. 3
    Ant colony optimization based subset feature selection in speech processing: Constructing graphs with degree sequences

    Ant colony optimization based subset feature selection in speech processing: Constructing graphs with degree sequences by Rajesvary Rajoo R., Salam R.A.

    Published 2024
    journal::journal article
    Save to List
    Saved in:
  4. 4
    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:
  5. 5
    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:
  6. 6
    Approximate methods for minimum vertex cover fail to provide optimal results on small graph instances: A review

    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
    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
    Solving university examination timetabling problem using intelligent water drops algorithm

    Solving university examination timetabling problem using intelligent water drops algorithm by Aldeeb B.A., Norwawi N.M., Al-Betar M.A., Jali M.Z.B.

    Published 2024
    Subjects: “…Intelligent water drops algorithm…”
    Conference Paper
    Save to List
    Saved in:
  9. 9
    Optimizing boarding school schedule using graph colouring : case study of Sekolah Menengah Sultan Abdul Halim / Nur Farhana Mohd Asri

    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
    “…The result has shown that the Greedy Algorithm has succeeded to produce the lowest minimal color compared to Graph Coloring Algorithm. …”
    Get full text
    Get full text
    Student Project
    Save to List
    Saved in:
  10. 10
    Optimizing boarding school schedule using graph coloring: case study of Sekolah Menengah Sultan Abdul Halim / Nur Farhana Mohd Asri

    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
    “…The result has shown that the Greedy Algorithm has succeeded to produce the lowest minimal color compared to Graph Coloring Algorithm. …”
    Get full text
    Get full text
    Research Reports
    Save to List
    Saved in:
  11. 11
    Graph theory approach for managing lecturers’ schedule using graph colouring method / Siti Nor Ba Basri, Nur Su’aidah Khozaid and Farhana Hazwani Ismail

    Graph theory approach for managing lecturers’ schedule using graph colouring method / Siti Nor Ba Basri, Nur Su’aidah Khozaid and Farhana Hazwani Ismail by Basri, Siti Nor Ba, Khozaid, Nur Su’aidah, Ismail, Farhana Hazwani

    Published 2023
    “…By using graph theory, graph colouring techniques, and ILP validation, this work optimizes lecturers' timetable scheduling, resolving conflicts, omissions, limitations, and preferences for optimal educational scheduling and resource allocation. …”
    Get full text
    Get full text
    Student Project
    Save to List
    Saved in:
  12. 12
    Modified And Ensemble Intelligent Water Drop Algorithms And Their Applications

    Modified And Ensemble Intelligent Water Drop Algorithms And Their Applications by O. F. Alijla, Basem

    Published 2015
    “…The Intelligent Water Drop (IWD) algorithm is a swarm-based model that is useful for undertaking optimization problems. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    Intelligent Examination Timetabling System Using Hybrid Intelligent Water Drops Algorithm

    Intelligent Examination Timetabling System Using Hybrid Intelligent Water Drops Algorithm by AlDeeb, BA, Norwawi, NM, Al-Betar, MA, Jali, MZ

    Published 2024
    Subjects:
    Proceedings Paper
    Save to List
    Saved in:
  14. 14
    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:
  15. 15
    IWDSA: a hybrid Intelligent Water Drops with a Simulated Annealing for the localization improvement in wireless sensor networks

    IWDSA: a hybrid Intelligent Water Drops with a Simulated Annealing for the localization improvement in wireless sensor networks by Gumaida, Bassam, Ibrahim, Adamu Abubakar

    Published 2024
    “…The proposed algorithm, named Intelligent Water Drops with Simulated Annealing (IWDSA), combines two powerful optimization methods: Intelligent Water Drops (IWD) and Simulated Annealing (SA). …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    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:
  17. 17
    Optimizing kindergarten schedule using : graph coloring / Nur Nabilah Salleh Muner

    Optimizing kindergarten schedule using : graph coloring / Nur Nabilah Salleh Muner by Salleh Muner, Nur Nabilah

    Published 2019
    “…The greedy algorithm was used to color the graph and it was supported by the C++ program. …”
    Get full text
    Get full text
    Research Reports
    Save to List
    Saved in:
  18. 18
    Optimization of electrical wiring design in buildings using particle swarm optimization and genetic algorithm / Tuan Ahmad Fauzi Tuan Abdullah

    Optimization of electrical wiring design in buildings using particle swarm optimization and genetic algorithm / Tuan Ahmad Fauzi Tuan Abdullah by Tuan Ahmad Fauzi, Tuan Abdullah

    Published 2017
    “…In this project, the main objective is to optimize the electrical distribution system design in buildings using optimization methods, which are Particle Swarm Optimization (PSO) and Genetic Algorithm (GA). …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  19. 19
    Graph-Based Algorithm With Self-Weighted And Adaptive Neighbours Learning For Multi-View Clustering

    Graph-Based Algorithm With Self-Weighted And Adaptive Neighbours Learning For Multi-View Clustering by He, Yanfang

    Published 2024
    “…To address this issue, this study incorporated joint graph learning from the gmc algorithm into swmcan, creating a new algorithm called swmcan-jg. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    Modeling of static and dynamic components of bio-nanorobotic systems

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

    Published 2012
    “…The first modeling technique applies graph algorithms to compute a new set of optimal weighted structural properties of C60 and C70 fullerenes. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: