Search Results - (( developing time graph algorithm ) OR ( java simulation optimization algorithm ))

Search alternatives:

Refine Results
  1. 1
    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
    “…Global pheromone update is performed after the completion of processing the jobs in order to reduce the pheromone value of resources. A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against existing grid resource management algorithms such as Antz algorithm, Particle Swarm Optimization algorithm, Space Shared algorithm and Time Shared algorithm, in terms of processing time and resource utilization. …”
    Get full text
    Get full text
    Get full text
    Thesis
    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
    “…Global pheromone update is performed after the completion of processing the jobs in order to reduce the pheromone value of resources.A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against other ant based algorithm, in terms of resource utilization. …”
    Get full text
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:
  3. 3
    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
    “…Resources with high pheromone value are selected to process the submitted jobs.Global pheromone update is performed after completion processing the jobs in order to reduce the pheromone value of resources.A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against other ant based algorithm, in terms of resource utilization.Experimental results show that EACO produced better grid resource management solution.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:
  4. 4
    Implementation of locust inspired scheduling algorithm with huge number of servers for energy efficiency in a cloud datacenter

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

    Published 2019
    “…Cloudsim is used as Discrete Event Simulation tool and Java as coding language to evaluate LACE algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    An Improved-Time Polynomial-Space Exact Algorithm For TSP In Degree-5 Graphs

    An Improved-Time Polynomial-Space Exact Algorithm For TSP In Degree-5 Graphs by Md Yunos, Norhazwani, Shurbevski, Aleksandar, Nagamochi, Hiroshi

    Published 2017
    “…Following a recent trend of research which focuses on developing algorithms for special types of TSP instances, namely graphs of limited degree, in an attempt to reduce a part of the time and space complexity, we present a polynomial-space branching algorithm for the TSP in an n-vertex graph with degree at most 5, and show that it has a running time of O∗(2.3500n), which improves the previous best known time bound of O∗(2.4723n) given by the authors (the 12th International Symposium on Operations Research and Its Application (ISORA 2015), pp.45–58, 2015). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  6. 6
    Attribute reduction based scheduling algorithm with enhanced hybrid genetic algorithm and particle swarm optimization for optimal device selection

    Attribute reduction based scheduling algorithm with enhanced hybrid genetic algorithm and particle swarm optimization for optimal device selection by Nwogbaga, Nweso Emmanuel, Latip, Rohaya, Affendey, Lilly Suriani, Abdul Rahiman, Amir Rizaan

    Published 2022
    “…The simulation is implemented with iFogSim and java programming language. …”
    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: 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 existing Smith-Waterman algorithm had complex memory and low performance where the time also was consumed caused by high sensitivity of the large sequences long. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  8. 8
    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 existing Smith-Waterman algorithm had complex memory and low performance where the time also was consumed caused by high sensitivity of the large sequences long. …”
    Get full text
    Get full text
    Student Project
    Save to List
    Saved in:
  9. 9
    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:
  10. 10
    Dynamical fuzzy autocatalytic set of combustion process in circulating fluidized bed boiler using transition matrix / Hazwani Hashim

    Dynamical fuzzy autocatalytic set of combustion process in circulating fluidized bed boiler using transition matrix / Hazwani Hashim by Hashim, Hazwani

    Published 2014
    “…The improvised GDAis able to reduce computer running time as compared to previous algorithm and able to deals with a sparse graph. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    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:
  12. 12
    OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT

    OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT by Murad S.S., Badeel R., Alsandi N.S.A., Alshaaya R.F., Ahmed R.A., Muhammed A., Derahman M.

    Published 2023
    “…To achieve this, we propose a new noble mechanism called Optimized Min-Min (OMin-Min) algorithm, inspired by the Min-Min algorithm. …”
    Review
    Save to List
    Saved in:
  13. 13
    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization

    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

    Published 2019
    “…This study proposes a car parking management system which applies Dijkstra’s algorithm, Ant Colony Optimization (ACO) and Binary Search Tree (BST) in structuring a guidance system for indoor parking. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  14. 14
    Computationally-efficient path planning algorithms in obstacle-rich environments based on visibility graph method

    Computationally-efficient path planning algorithms in obstacle-rich environments based on visibility graph method by Abdul Latip, Nor Badariyah

    Published 2018
    “…In order to address the high computation time, an improved VG called Iterative Equilateral Spaces Oriented Visibility Graph (IESOVG) has been developed by reducing the number of obstacles used for path planning. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    COVID-19 DATA EXPLORATION USING MAPPER ALGORITHM

    COVID-19 DATA EXPLORATION USING MAPPER ALGORITHM by Carey, Ling Yu Fan

    Published 2023
    “…The resulting mapper graphs reveal the pandemic’s development progress across time and place during year 2021. …”
    Get full text
    Get full text
    Final Year Project Report / IMRAD
    Save to List
    Saved in:
  16. 16
    Features selection for intrusion detection system using hybridize PSO-SVM

    Features selection for intrusion detection system using hybridize PSO-SVM by Tabaan, Alaa Abdulrahman

    Published 2016
    “…Hybridize Particle Swarm Optimization (PSO) as a searching algorithm and support vector machine (SVM) as a classifier had been implemented to cope with this problem. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    Preliminary framework of topology control algorithm in WSN to achieve node's energy efficiency

    Preliminary framework of topology control algorithm in WSN to achieve node's energy efficiency by Shahabuddin, M.Z., Hasbullah, H., Aziz, I.A.

    Published 2016
    “…The objective of this paper is to propose fundamental modelling of topology control algorithm to conserve individual WSN node's energy, and at the same time preserving the graph connectivity. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  18. 18
    Scalable workflow scheduling algorithm for minimizing makespan and failure probability

    Scalable workflow scheduling algorithm for minimizing makespan and failure probability by Abdul Aziz, Maslina, Ninggal, Izuan Hafez

    Published 2019
    “…A workflow generator was developed to generate large task graphs randomly and scheduled the parallel applications. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    Enhancement of Ant System Algorithm for Course Timetabling Problem

    Enhancement of Ant System Algorithm for Course Timetabling Problem by Djamarus, Djasli

    Published 2009
    “…This research starts with developing an algorithm based on original concept of Ant System Algorithm. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    Solving single machine scheduling problem with maximum lateness using a genetic algorithm

    Solving single machine scheduling problem with maximum lateness using a genetic algorithm by Nazif, Habibeh, Lee, Lai Soon

    Published 2010
    “…We develop an optimised crossover operator designed by an undirected bipartite graph within a genetic algorithm for solving a single machine family scheduling problem, where jobs are partitioned into families and setup time is required between these families. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: