Search Results - (( developing failure connection algorithm ) OR ( java simulation optimization algorithm ))

Refine Results
  1. 1
  2. 2
  3. 3

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

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

    Node placement optimization using extended virtual force and cuckoo search algorithm in wireless sensor network by Puteri Azwa, Ahmad

    Published 2014
    “…This random deployment causes issues such as coverage hole, overlapping and connectivity failure that contributes to the performance of coverage and connectivity of WSN. …”
    Get full text
    Get full text
    Get full text
    Thesis
  6. 6

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

    Multi-Hop Selective Constructive Interference Flooding Protocol For Wireless Sensor Networks by Alhalabi, Huda A. H.

    Published 2019
    “…The second step in MSCIF protocol involves designing a selection algorithm to select the minimum connected dominating nodes. …”
    Get full text
    Get full text
    Thesis
  8. 8

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

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

    Wireless water quality cloud monitoring system with self-healing algorithm by Syed Ariffin, Sharifah Hafizah, Baharudin, Muhammad Ariff, Mohd Fauzi, Mohd Husaini, Abdul Latiff, Nurul Mu'azzah, Syed Yusof, Sharifah Kamilah, Abdul Latiff, Nurul Adilah

    Published 2017
    “…The result shows that the self-healing algorithm is able to recover itself without physical reseting, in case during distruption of wireless service connection failure.…”
    Get full text
    Get full text
    Conference or Workshop Item
  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
  14. 14

    Power system intentional islanding for different contingency scenarios using discrete optimization technique by Nur Zawani Binti Saharuddin

    Published 2023
    “…Power systems are susceptible to unavoidable failures or outages. One of these incidents is critical line outage, which can lead to the occurrence of severe cascading failures. …”
    text::Thesis
  15. 15

    Density based subspace clustering: a case study on perception of the required skill by Rahmat Widia, Sembiring

    Published 2014
    “…This research aims to develop an improved model for subspace clustering based on density connection. …”
    Get full text
    Get full text
    Thesis
  16. 16

    Density subspace clustering: a case study on perception of the required skill by Sembiring, Rahmat Widia

    Published 2014
    “…This research aims to develop an improved model for subspace clustering based on density connection. …”
    Get full text
    Get full text
    Thesis
  17. 17
  18. 18

    Intelligent DNA signature detection for internet worms by Ghazali, Osman

    Published 2011
    “…Active worms spread in an automated fashion flooding the Internet in a very short time.Slammer worm infected more than 90% of vulnerable machines within 10 minutes on January 25th, 2003.Hence it is necessary to monitor and detect the worms as soon as they are introduced to minimize the damage caused by them.This project concentrates on developing an anti-scanning worm detection system that can automatically detect and control the spread of internet scanning worms without any manual intervention.The Intelligent Failure Connection Algorithm (IFCA) developed in this project can detect both stealth and normal worms within a short time.Experiments conducted as part of the evaluation shows that IFCA detects a worm within two scanning cycles of the worm.This is faster than any of the currently available algorithms or mechanisms reported in the literature.The IFCA uses Artificial Immune System (AIS) for the purpose of monitoring and detecting the worms.The Traffic Signature Algorithm (TSA) developed in the project captures the traffic signature of the worm from the infector when it sends the traffic to the victim.The Intelligent DNA Signature Detection Algorithm (IDNASDA) algorithm works by breaking an infection session into different infection phases, each phase containing a number of different traffic such as Internet Control Message Protocol (ICMP), Transmission Control Protocol (TCP), or User Datagram Protocol (UDP).Finally it converts the traffic signature to DNA signature.The tests carried out show that the IDNASD could detect DNA signature for MSBlaster worm.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Monograph
  19. 19
  20. 20

    Reproducing kernel Hilbert space method for cox proportional hazard model by Abdul Manaf, Nur'azah

    Published 2016
    “…Finally, we propose an algorithm of minimization of the loss function in the general Cox model. …”
    Get full text
    Get full text
    Get full text
    Thesis