Search Results - (( java simulation optimization algorithm ) OR ( using allocation graph 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
    “…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
  2. 2

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

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

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

    An improved algorithm for channel allocation on direct sequence spread spectrum by Handrizal, M

    Published 2011
    “…Graph coloring is a useful algorithm for channel allocation on Direct Sequence Spread Spectrum (DSSS).Through this algorithm,each access point (AP) that adjacent gives different channels based on colors available.Welsh Powell algorithm and Degree of saturation (Dsatur) are the popular algorithms being used for channel allocation in this domain. …”
    Get full text
    Get full text
    Thesis
  6. 6

    An Improved of Channel Allocation for WLAN Using Vertex Merge Algorithm by Mr, Handrizal, Mr, Muhammad Zarlis, Noraziah, Ahmad, Abdalla, Ahmed N.

    Published 2012
    “…Graph colouring is a useful algorithm for channel allocation on wireless local area network (WLAN). …”
    Get full text
    Get full text
    Conference or Workshop Item
  7. 7

    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
    “…Different colours are allocated to each vertex using graph colouring techniques such as the vertices algorithm or the edges algorithm, ensuring that clashing courses and lecturers are assigned different time slots. …”
    Get full text
    Get full text
    Student Project
  8. 8

    Graph algorithm vertex coloring by Suyudi, M., Sukono, ., Mustafa, Mamat, Bon, A.T.

    Published 2019
    “…A vertex coloring algorithm has been presented. As a result of applying vertex coloring algorithm no two vertex are to be allocated in same color if they are adjacent in graph. …”
    Get full text
    Get full text
    Conference or Workshop Item
  9. 9

    Find the maximum clique by graph coloring using heuristic greedy by Mustafa, Mamat, Suyudi, ., Sukono, ., Bon, A.T.

    Published 2019
    “…A vertex coloring algorithm has been presented. As a result of applying vertex coloring algorithm no two vertex are to be allocated in same color if they are adjacent in graph. …”
    Get full text
    Get full text
    Conference or Workshop Item
  10. 10

    The graph heuristic with great deluge algorithm to solve the ITC2007 examination timetabling problem by Chuan, Wei Kiat

    Published 2014
    “…The graph heuristic with great deluge algorithm will be used to solve this problem. …”
    Get full text
    Get full text
    Undergraduates Project Papers
  11. 11

    Partial examination assignment approaches for solving examination timetabling problems by Mandal, Ashis Kumar

    Published 2016
    “…This thesis presents partial examination assignment approaches to address the examination timetabling problem. The proposed algorithms work by first ordering all examinations using graph heuristics ordering strategies. …”
    Get full text
    Get full text
    Thesis
  12. 12
  13. 13
  14. 14

    Development of deep reinforcement learning based resource allocation techniques in cloud radio access network by Amjad, Iqbal

    Published 2022
    “…This thesis proposes three DRLbased resource allocation algorithms that optimize the CRAN performance in terms of energy efficiency (EE), spec tral efficiency (SE), and total power consumption. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  15. 15

    Solving a backtracking intelligently : a case study / Muthukkaruppan Annamalai by Annamalai, Muthukkaruppan

    Published 2001
    “…In this study, we have modeled the CSP as a constraint graph. This allows us to device an augmented backtracking algorithm that could be employed to find a solution for this CSP. …”
    Get full text
    Get full text
    Article
  16. 16

    Adaptive and optimized radio resource allocation algorithms for OFDMA based networks by Saadat, Md. Nazmus

    Published 2015
    “…AORAA contains an adaptive and optimized subcarrier allocation algorithm which uses graph theoretic techniques to do the best probable matching of subcarrier and users’ channel information. …”
    Get full text
    Get full text
    Thesis
  17. 17

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

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

    Published 2017
    “…By considering these features in mathematical models using a hypergraph and Koenig graphs, we can obtain an accurate description of the network. …”
    Get full text
    Get full text
    Thesis
  19. 19

    Self-organizing network technique for resource allocation and mobility management in LTE femtocell network / Labeeb Mohsin Abdullah by Abdullah, Labeeb Mohsin

    Published 2015
    “…The first experiment was conducted by applying two approaches i) graph colouring algorithm, ii) DLS scheme. The second experiment was to determine the femtocell location by using DSL scheme as well. …”
    Get full text
    Get full text
    Thesis
  20. 20

    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