Search Results - (( java simulation optimization algorithm ) OR ( quality reduction mining algorithm ))

  • Showing 1 - 19 results of 19
Refine Results
  1. 1
  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

    Ant colony optimization algorithm for load balancing in grid computing by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

    Published 2012
    “…The proposed algorithm is known as the enhance ant colony optimization (EACO). …”
    Get full text
    Get full text
    Get full text
    Monograph
  4. 4

    Towards lowering computational power in IoT systems: Clustering algorithm for high-dimensional data stream using entropy window reduction by Alkawsi G., Al-amri R., Baashar Y., Ghorashi S., Alabdulkreem E., Kiong Tiong S.

    Published 2024
    “…This paper introduces an Entropy Window Reduction (EWR) algorithm, which is an improved version of the BOCEDS technique. …”
    Article
  5. 5

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

    Propositional satisfiability method in rough classification modeling for data mining by Abu Bakar, Azuraliza

    Published 2002
    “…In rough set approach to data mining, the set of interesting rules are determined using a notion of reduct. …”
    Get full text
    Get full text
    Thesis
  7. 7

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

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

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

    Evaluation and optimization of frequent, closed and maximal association rule based classification by Mohd Shaharanee, Izwan Nizal, Hadzic, Fedja

    Published 2014
    “…Real world applications of association rule mining have well-known problems of discovering a large number of rules, many of which are not interesting or useful for the application at hand.The algorithms for closed and maximal item sets mining significantly reduce the volume of rules discovered and complexity associated with the task, but the implications of their use and important differences with respect to the generalization power, precision and recall when used in the classification problem have not been examined.In this paper, we present a systematic evaluation of the association rules discovered from frequent, closed and maximal item set mining algorithms, combining common data mining and statistical interestingness measures, and outline an appropriate sequence of usage.The experiments are performed using a number of real-world datasets that represent diverse characteristics of data/items, and detailed evaluation of rule sets is provided as a whole and w.r.t individual classes. …”
    Get full text
    Get full text
    Article
  12. 12

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

    Problem restructuring in interger programming for reduct searching by Ungku Chulan, Ungku Azmi Iskandar

    Published 2003
    “…In addition, the length of reducts generated by both approaches are also compared to ensure that no quality deterioration occurred along the way. …”
    Get full text
    Get full text
    Thesis
  14. 14

    Clustering of large time-series datasets using a multi-step approach / Saeed Reza Aghabozorgi Sahaf Yazdi by Yazdi, Saeed Reza Aghabozorgi Sahaf

    Published 2013
    “…Many of these studies focus on the time complexity of time-series clustering in large datasets and utilize dimensionality reduction approaches and conventional clustering algorithms to address the problem. …”
    Get full text
    Get full text
    Thesis
  15. 15

    Class binarization with self-adaptive algorithm to improve human activity recognition by Zainudin, Muhammad Noorazlan Shah

    Published 2018
    “…In order to estimate the quality of ‘pruned’ features, self-adaptive DE algorithm is proposed. …”
    Get full text
    Get full text
    Thesis
  16. 16
  17. 17

    SecPath: Energy efficient path reconstruction in wireless sensor network using iterative smoothing by Abd, Wamidh Jwdat

    Published 2019
    “…To achieve energy efficiency, it compresses the packet information by using GZIP tools in JAVA. SecPath is evaluated with several variations using 400 nodes in WSN deployments as well as large-scale simulations. …”
    Get full text
    Get full text
    Thesis
  18. 18

    Energy efficient path reconstruction in wireless sensor network using iPath by Hasan, Sazlinah, Abd, Wamidh Jwdat, Ariffin, Ahmad Alauddin

    Published 2019
    “…To achieve energy efficiency, it compresses the packet information by using GZIP tools in JAVA. Energy efficient iPath (E-iPath) is evaluated with several variations of nodes in WSN deployments as well as large-scale simulations. …”
    Get full text
    Get full text
    Get full text
    Article
  19. 19

    Anfis Modelling On Diabetic Ketoacidosis For Unrestricted Food Intake Conditions by Saraswati, Galuh Wilujeng

    Published 2017
    “…The project has also implemented the optimization process onto the proposed ANFIS model through the hybrid of Genetic Algorithm on the fuzzy membership function of the ANFIS model. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis