Search Results - (( intelligence _ protocol algorithm ) OR ( intelligence task scheduling algorithm ))

Refine Results
  1. 1

    Multi agent quality of service routing based on scheme ant colony optimization algorithm by Baygi, Maassoumeh Javadi

    Published 2014
    “…The proposed scheme has been simulated by OMNET++ and compared with standard AntNet and two well-known standard QoS routings; Widest Shortest Path (WSP) algorithm and Shortest Widest Path (SWP) algorithm. …”
    Get full text
    Get full text
    Thesis
  2. 2
  3. 3

    Hybrid ant colony system algorithm for static and dynamic job scheduling in grid computing by Alobaedy, Mustafa Muwafak Theab

    Published 2015
    “…The main part of RMS is the scheduler algorithm which has the responsibility to map submitted tasks to available resources. …”
    Get full text
    Get full text
    Get full text
    Thesis
  4. 4
  5. 5
  6. 6
  7. 7
  8. 8
  9. 9
  10. 10

    Cohesive token passing algorithm utilizing software agents by Abdulrazzak, A. Fua’ad, Subramaniam, Shamala

    Published 2010
    “…An enhanced Token Ring protocol governed by intelligent processing has been implemented in this paper. …”
    Get full text
    Get full text
    Article
  11. 11

    Development of optimized maintenance scheduling model for coal-fired power plant boiler by Noor Fazreen Binti Ahmad Fuzi, Ms.

    Published 2023
    “…Computing intelligence is a soft-computing subset of artificial intelligence referring to the potential of a computer to gain knowledge from an experimental observations or specific task. …”
    text::Thesis
  12. 12

    Intelligent dashboard with speech enhancement by Abdul Rahman, Abdul Wahab, Tan, Eng Chong, Abut, Huseyin

    Published 1997
    “…Numerous asynchronous scheduling tasks necessitate the architecture to be re-configurable. …”
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  13. 13

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

    Processing time estimation in precision machining industry using AI / Lim Say Li by Lim, Say Li

    Published 2017
    “…Neural Network (NN) model is chosen as the artificial intelligence approach used in this research. Levenberg-Marquardt algorithm is used as the training algorithm. …”
    Get full text
    Get full text
    Thesis
  15. 15

    A New Grid Resource Discovery Framework by Mahamat Issa, Hassan, Azween , Abdullah

    “…Resource discovery (RD) is an important key issue in grid systems since resource reservation and task scheduling are based on it. This paper proposes a novel semantic-based scalable decentralized grid RD framework. …”
    Get full text
    Get full text
    Conference or Workshop Item
  16. 16

    Efficient and scalable ant colony optimization based WSN routing protocol for IoT by Sharmin, Afsah, Anwar, Farhat, Motakabber, S. M. A.

    Published 2020
    “…For this reason, many intelligent systems have been utilized to design routing algorithms to handle the network's dynamic state. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  17. 17

    Particle swarm optimization technique for optimal economic load dispatch / Muhammad Hilmi Nordin by Nordin, Muhammad Hilmi

    Published 2014
    “…In the operation and planning of a power system, Economic Load Dispatch is a crucial task to be performed which decided the generation schedule of generating units with the objective of minimizing the total fuel cost while maintaining the operational constraints. …”
    Get full text
    Get full text
    Thesis
  18. 18

    A New Grid Resource Discovery Framework by Hassan, Mahamat I., Azween, Abdullah

    Published 2011
    “…Resource discovery (RD) is an important key issue in grid systems since resource reservation and task scheduling are based on it. This paper proposes a novel semantic-based scalable decentralized grid RD framework. …”
    Get full text
    Get full text
    Get full text
    Citation Index Journal
  19. 19

    A New Grid Resource Discovery Framework by Mahamat Issa, Hassan, Azween, Abdullah

    Published 2009
    “…Resource discovery (RD) is an important key issue in grid systems since resource reservation and task scheduling are based on it. This paper proposes a novel semantic-based scalable decentralized grid RD framework. …”
    Get full text
    Get full text
    Citation Index Journal
  20. 20