Search Results - (( simulation optimization based algorithm ) OR ( using computational graph algorithm ))

Search alternatives:

Refine Results
  1. 1
    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:
  2. 2
    Ant colony optimization algorithm for load balancing in grid computing

    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
    Save to List
    Saved in:
  3. 3
    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:
  4. 4
    Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing

    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
    Save to List
    Saved in:
  5. 5
    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
    “…Job scheduling algorithm has a significant influence on grid computing performance. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  6. 6
    Resource management in grid computing using ant colony optimization

    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
    Save to List
    Saved in:
  7. 7
    Quality of service in mobile IP networks with parametric multi-channel routing algorithms based on linear programming approach

    Quality of service in mobile IP networks with parametric multi-channel routing algorithms based on linear programming approach by Gholizadeh, Somayyeh

    Published 2018
    “…This approach tunes the parameters of the linear programming models that are used in the other algorithms by using a dynamic element. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  8. 8
    An efficient multi join query optimization for relational database management system using swarm intelligence approaches

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

    Published 2016
    “…The TP ABC algorithm can be utilized to solve MJQO problems via simulation and increasing exploration and exploitation whilst balancing them for optimal results from giving queries. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    An efficient multi join query optimization for relational database management system using swarm intelligence approaches

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

    Published 2016
    “…The TP ABC algorithm can be utilized to solve MJQO problems via simulation and increasing exploration and exploitation whilst balancing them for optimal results from giving queries. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    PAPR Reduction Using Genetic Algorithm (GA) In OFDM System

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

    Published 2018
    “…In this thesis, a Genetic algorithm (GA) technique is proposed. 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
    Save to List
    Saved in:
  11. 11
    Independent And Dependent Job Scheduling Algorithms Based On Weighting Model For Grid Environment

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

    Published 2018
    “…However, the previous algorithms are complicated and needed a lot of computational resources. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  12. 12
    Design of DNA fragment assembly using IWP method on application-specific integrated-circuit / Hasniliati Hassan

    Design of DNA fragment assembly using IWP method on application-specific integrated-circuit / Hasniliati Hassan by Hassan, Hasniliati

    Published 2017
    “…After reviewing various algorithms, it was decided to apply de Bruijn graphs and Eulerian circuits that are based on graph theory. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    DNA sequence design for direct-proportional length-based DNA computing: Particle swarm optimization vs population based ant colony optimization

    DNA sequence design for direct-proportional length-based DNA computing: Particle swarm optimization vs population based ant colony optimization by Zulkifli, Md. Yusof, Muhammad Arif, Abdul Rahim, Sophan Wahyudi, Nawawi, Kamal, Khalil, Zuwairie, Ibrahim

    Published 2012
    “…Generally, in DNA computing, the DNA sequences used for the computation should be critically designed in order to reduce error that could occur during computation. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  14. 14
    Hypergraph-based resource allocation in wireless mesh networks

    Hypergraph-based resource allocation in wireless mesh networks by Abbas, Bashar Khudhair

    Published 2017
    “…Algorithms, OFDMA-based channel-width adaptation in a wireless mesh network (OBCWA) and QoS-aware channel-width adaptation (QACWA), were compared. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    Accelerating graph algorithms with priority queue processor

    Accelerating graph algorithms with priority queue processor by Heng Sun, Ch'ng, Eik Wee, Chew, Shaikh-Husin, Nasir, Hani, Mohamed Khalil

    Published 2006
    “…DijkstraÂ’s algorithm is chosen as the target implementation, as many state-of-the-art graph algorithms use DijkstraÂ’s algorithm at the heart of their computational engine. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    Vector evaluated particle swarm optimization approach to solve assembly sequence planning problem

    Vector evaluated particle swarm optimization approach to solve assembly sequence planning problem by A. Mukred, Jameel A., A. Rahim, Ruzairi, Mohamad, Elmy Johana, Salh, Adeeb, Ashyap, Adel Y. I., Abdullah, Qazwan, AL-Fadhali, Najib, Al-Ameri, S., Al-Ashwal, Rania

    Published 2022
    “…Meta-heuristic method is able to escape the local optima. Simulated Annealing (SA) is used where search is done in sequence basis and to solve optimization problems. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    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
    “…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
    Save to List
    Saved in:
  18. 18
    Graph processing hardware accelerator for shortest path algorithms in nanometer very large-scale integration interconnect routing

    Graph processing hardware accelerator for shortest path algorithms in nanometer very large-scale integration interconnect routing by Ch'ng, Heng Sun

    Published 2007
    “…Graphs are pervasive data structures in computer science, and algorithms working with them are fundamental to the field. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  19. 19
    Optimization-based simulation algorithm for predictive-reactive job-shop scheduling of reconfigurable manufacturing systems

    Optimization-based simulation algorithm for predictive-reactive job-shop scheduling of reconfigurable manufacturing systems by Tan, Joe Yee

    Published 2022
    “…In this case, the effectiveness and reliability of RMS is increase by combining the simulation with the optimization algorithm.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    Simulated Kalman Filter: A Novel Estimation-based Metaheuristic Optimization Algorithm

    Simulated Kalman Filter: A Novel Estimation-based Metaheuristic Optimization Algorithm by Zuwairie, Ibrahim, Nor Hidayati, Abd Aziz, Nor Azlina, Ab. Aziz, Saifudin, Razali, Mohd Saberi, Mohamad

    Published 2016
    “…In this paper, a new population-based metaheuristic optimization algorithm, named Simulated Kalman Filter (SKF) is introduced. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:

Search Tools: