Search Results - (( program solution clustering algorithm ) OR ( java application modified algorithm ))

  • Showing 1 - 13 results of 13
Refine Results
  1. 1
  2. 2
  3. 3

    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
  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
    Get full text
    Thesis
  5. 5

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

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

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

    Prevention And Detection Mechanism For Security In Passive Rfid System by Khor, Jing Huey

    Published 2013
    “…A GUI is created in a form of JAVA application to display data detected from tag. …”
    Get full text
    Get full text
    Thesis
  9. 9

    Automatic generation of content security policy to mitigate cross site scripting by Mhana, Samer Attallah, Din, Jamilah, Atan, Rodziah

    Published 2016
    “…The algorithm is implemented as a plugin. It does not interfere with the web application original code. …”
    Get full text
    Get full text
    Conference or Workshop Item
  10. 10

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

    Adaptive persistence layer for synchronous replication (PLSR) in heterogeneous system by Beg, Abul Hashem

    Published 2011
    “…The PLSR architecture model, workflow and algorithms are described. The PLSR has been developed using Java Programming language. …”
    Get full text
    Get full text
    Thesis
  12. 12
  13. 13