Search Results - optimal ((((graph algorithm) OR (system algorithm))) OR (computer algorithm))

Refine Results
  1. 1

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

    Published 2012
    “…This research proposes an enhancement of the ant colony optimization algorithm that caters for dynamic scheduling and load balancing in the grid computing system. …”
    Get full text
    Get full text
    Get full text
    Monograph
  2. 2

    Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing by Husna, Jamal Abdul Nasir

    Published 2011
    “…This research proposes an Enhanced Ant Colony Optimization (EACO) algorithm that caters dynamic scheduling and load balancing in the grid computing system. …”
    Get full text
    Get full text
    Get full text
    Thesis
  3. 3

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

    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
    “…Dijkstra and ACO are integrated to produce the smart guidance algorithm for the indoor parking system. Dijkstra algorithm initials the paths to finding the shortest path while ACO optimizes the paths. …”
    Get full text
    Get full text
    Get full text
    Article
  5. 5

    Resource management in grid computing using ant colony optimization by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

    Published 2011
    “…Managing resources in grid computing system is complicated due to the distributed and heterogeneous nature of the resources.Stagnation in grid computing system may occur when all jobs require or are assigned to the same resources which lead to the resources having high workload or the time taken to process a job is high.This research proposes an Enhanced Ant Colony Optimization (EACO) algorithm that caters dynamic scheduling and load balancing in the grid computing system.The algorithm consists of three new mechanisms that organize the work of an ant colony i.e. initial pheromone value mechanism, resource selection mechanism and pheromone update mechanism.The resource allocation problem is modeled as a graph that can be used by the ant to deliver its pheromone.This graph consists of four types of vertices which are job, requirement, resource and capacity that are used in constructing the grid resource management element.The proposed EACO algorithm takes into consideration the capacity of resources and the characteristics of jobs in determining the best resource to process a job.EACO selects the resources based on the pheromone value on each resource which is recorded in a matrix form.The initial pheromone value of each resource for each job is calculated based on the estimated transmission time and execution time of a given job. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Monograph
  6. 6

    Nonlinear convergence algorithm: structural properties with doubly stochastic quadratic operators for multi-agent systems by Abdulghafor, Rawad Abdulkhaleq Abdulmolla, Turaev, Sherzod, Zeki, Akram M., Adamu, Abubakar Ibrahim

    Published 2018
    “…We develop two algorithms: 1) the nonlinear algorithm of extreme doubly stochastic quadratic operator (NLAEDSQO) to generate all the convergent EDSQOs and 2) the nonlinear convergence algorithm (NLCA) of EDSQOs to investigate the optimal consensus for MAS. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  7. 7

    Effects of Different Superpixel Algorithms on Interactive Segmentations by Goh, Kok Luong, Ng, Giap Weng, Muzaffar Hamzah, Chai, Soo See

    Published 2022
    “…In this study, five different types of superpixels ranging from watershed, density, graph, clustering and energy optimization categories are evaluated. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  8. 8

    Effects of Different Superpixel Algorithms on Interactive Segmentations by Soo See, Chai, Luong Goh, Kok, Weng Ng, Giap, Muzaffar, Hamzah

    Published 2022
    “…In this study, five different types of superpixels ranging from watershed, density, graph, clustering and energy optimization categories are evaluated. …”
    Get full text
    Get full text
    Get full text
    Article
  9. 9

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

    HATS: HetTask scheduling by Koohi, Sina Zangbari, Abdul Hamid, Nor Asilah Wati, Othman, Mohamed, Ibragimov, Gafurjan

    Published 2022
    “…The proposed algorithm adopts an updated multi-level hyper-graph partitioning approach. …”
    Get full text
    Get full text
    Article
  11. 11

    An efficient multi join query optimization for relational database management system using swarm intelligence approaches by Alsaedi, Ahmed Khalaf Zager

    Published 2016
    “…A directed acyclic graph, based on materialized query graph, aids in the optimization of algorithms and solving MJQO by removing non-promising QEP, which decreases the QEP combination space. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  12. 12

    An efficient multi join query optimization for relational database management system using swarm intelligence approaches by Alsaedi, Ahmed Khalaf Zager

    Published 2016
    “…A directed acyclic graph, based on materialized query graph, aids in the optimization of algorithms and solving MJQO by removing non-promising QEP, which decreases the QEP combination space. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  13. 13

    PAPR Reduction Using Genetic Algorithm (GA) In OFDM System by Mohd Ramdan, Fatin Najwa Nursyadza

    Published 2018
    “…GA is a type of optimization algorithm, which is natural-based selection and is used to find the optimal solution to the computational problem that maximizes or minimizes a particular function. …”
    Get full text
    Get full text
    Monograph
  14. 14

    Independent And Dependent Job Scheduling Algorithms Based On Weighting Model For Grid Environment by M. Al-Najjar, Hazem

    Published 2018
    “…As a result, researchers have tried to improve job scheduling system using multiple algorithms. However, the previous algorithms are complicated and needed a lot of computational resources. …”
    Get full text
    Get full text
    Thesis
  15. 15

    Combinatorial test suites generation strategy utilizing the whale optimization algorithm by Ali Abdullah, Hassan, Salwani, Abdullah, Kamal Zuhairi, Zamli, Rozilawati, Razali

    Published 2020
    “…In the last 15 years, applications of meta-heuristics as the backbone of t-way test suite generation have shown promising results (e.g. Particle Swarm Optimization, Cuckoo Search, Flower Pollination Algorithm, and Hyper-Heuristics (HHH), to name a few). …”
    Get full text
    Get full text
    Get full text
    Article
  16. 16

    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 challenge in regression testing is the selection of best test cases from the existing test suite.This paper presents an evolutionary regression test case prioritization for object-oriented software based on extended system dependence graph model of the affected program using genetic algorithm. …”
    Get full text
    Get full text
    Article
  17. 17

    Recent research in cooperative path planning algorithms for multi-agent using mixed- integer linear programming by Che Ku, Nor Azie Hailma, Omar, Rosli, Sabudin Elia Nadira, Sabudin Elia Nadira

    Published 2016
    “…This paper will review and compare the performances of those existing methods that can find solution without graph search algorithm such as Mixed-Integer Linear Programming (MILP) techniques which exactly solves the problem and then propose four alternative MILP formulations which are computationally less intensive and suited for real-time purposes, but yield a theoretically guaranteed suboptimal solution.…”
    Get full text
    Get full text
    Article
  18. 18

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

    Determining the optimal number of GAT and GCN layers for node classification in graph neural networks by Noor, Humaira, Islam, Niful, Hossain Mukta, Md Saddam, Nur Shazwani, Kamarudin, Khan Raiaan, Mohaimenul Azam, Azam, Sami

    Published 2023
    “…Our proposed approximation technique may provide valuable insights for enhancing efficiency and accuracy of the Graph Neural Network algorithms.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  20. 20

    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