Search Results - (( java loading optimization algorithm ) OR ( program solution clustering algorithm ))

  • Showing 1 - 12 results of 12
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
  4. 4

    An integrated model of automated elementary programming feedback using assisted and recommendation approach by Safei, Suhailan

    Published 2017
    “…Meanwhile, similar difficulty groups of the computer programs were generated using a K-Means clustering algorithm that was enhanced with ranking consideration. …”
    Get full text
    Get full text
    Get full text
    Thesis
  5. 5

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

    Published 2009
    “…For this kind of problem, researchers believe that it will be better to find an approximate solution that can be delivered by a stochastic algorithm than waiting for an exact solution from the deterministic algorithm. …”
    Get full text
    Get full text
    Get full text
    Thesis
  6. 6

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

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

    Linear programming approach for scheduling sports league problems in Malaysia by Ahmad Rosdi, Muhammad Ifwat

    Published 2017
    “…In order to solve the formulated LP model, we proposed several solution methods such as simplex and genetics algorithm. …”
    Get full text
    Get full text
    Get full text
    Thesis
  9. 9

    K Nearest Neighbor Joins And Mapreduce Process Enforcement For The Cluster Of Data Sets In Bigdata by Md Shah, Wahidah, Othman, Mohd Fairuz Iskandar, Hussian Hassan, Ali Abdul, Talib, Mohammed Saad, Mohammed, Ali Abdul Jabbar

    Published 2018
    “…K Nearest Neighbor Joins (KNN join) are regarded as highly primitive and expensive operations in the data mining.The efficient use of KNN join has proven good results in finding the objects from two data sets prevailed in the huge databases.This has been achieved with the combination of K-Nearest Neighbor query and join operation to find the distinct objects from different data sets.MapReduce is a newly introduced program with the combination of Map Procedure method and Reduce Method widely used in BigData.MapReduce is enriched with parallel distributed algorithm to find the results on a cluster of data sets in BigData.In this paper,the combination of KNN join and MapReduce methods are utilized on the cluster of data sets in BigData for knowledge discovery.Exploring the pinpoint data from huge data sets stored in Big Data demands the distributed large scale data processing.The present research paper is focusing on generic steps for KNN joins exploration operations on MapReduce.The operations of KNN Join are targeted to perform the data partitioning and data pre-processing and necessary calculations.By utilizing the combination of KNN joins with MapReduce methods on BigData data sets will demonstrate a solution for complex computational analysis. …”
    Get full text
    Get full text
    Get full text
    Article
  10. 10

    A Framework for Green Energy Resources Identification and Integration Supported by Real-Time Monitoring, Control, and Automation Applications by Far Chen, Jong

    Published 2025
    “…To address these challenges, a novel Geographical Information System-based fuzzy Technique for Order Preference by Similarity to Ideal Solution coupled with filtration algorithms was proposed. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  11. 11

    Bottleneck-based heuristic for permutation flowshop scheduling by Isa, Noor Amira

    Published 2017
    “…There are four potential dominant machines (M1, M2, M3, M4) clustered as bottleneck machines. A total 1000 set random processing time for each job sizes was tested using Excel simple programming with built in Visual Basic for Application (VBA). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  12. 12