Search Results - (( java simulation optimization algorithm ) OR ( using communication path 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

    Finding minimum path by using Genetic Algorithm (GA)/ Siti Zuraifah Hashim by Hashim, Siti Zuraifah

    Published 2007
    “…This problem generalizes several traditional shortest path problems and has applications in transportation and communication networks. …”
    Get full text
    Get full text
    Thesis
  6. 6

    Novel Link Establishment Communication Scheme against Selfish Attack Using Node Reward with Trust Level Evaluation Algorithm in MANET by Hemalatha, S., Kshirsagar, P.R., Manoharan, H., Vasantha Gowri, N., Vani, A., Qaiyum, S., Vijayakumar, P., Tirth, V., Haleem, S.L.A., Chakrabarti, P., Teressa, D.M.

    Published 2022
    “…The proposed novel link establishment communication (NLEC) technique is used to find the dependable routing path against intruder node available in the network. …”
    Get full text
    Get full text
    Article
  7. 7

    Resource-Efficient Coverage Path Planning for UAV-Based Aerial IoT Gateway by Nurul Saliha A. Ibrahim, Nurul Saliha A. Ibrahim, Faiz A. Saparudin, Faiz A. Saparudin

    Published 2023
    “…The EECPP is composed of two algorithms: the Stop Point Prediction Algorithm using K-Means, and Path Planning Algorithm using Particle Swarm Optimization. …”
    Get full text
    Get full text
    Get full text
    Article
  8. 8

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

    Resource-efficient coverage path planning for unmanned aerial vehicle based aerial gateway in LoRaWAN by Ibrahim, Nurul Saliha Amani

    Published 2022
    “…EECPP consist of two algorithms which is Stop Point Prediction Algorithm using K-Means, which finding the stop point for the AG after grouping the IDs into clusters, and Path Planning Algorithm using Particle Swarm Optimization which connect all of the stop point in shortest route. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  10. 10
  11. 11

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

    A novel swarm-based optimisation algorithm inspired by artificial neural glial network for autonomous robots by Ismail, Amelia Ritahani, Tumian, Afidalina

    Published 2019
    “…The main idea in this algorithm is the indirect communication between the ants which is established by the means of pheromones in finding the shortest path between their nest and food [14]. …”
    Get full text
    Get full text
    Monograph
  14. 14

    An adaptive relay selection scheme for enhancing network stability in VANETs by Al-Kharasani, Ameen Mohammed Abdulkarem, Ahmad Zukarnain, Zuriati, Subramaniam, Shamala, Mohd Hanapi, Zurina

    Published 2020
    “…In this paper, we propose a new improvement to the mechanism of the Optimized Link State Routing Protocol(OLSR) protocol, named Cluster-based Adept Cooperative Algorithm (CACA), where each vehicle estimate a reliable low-overhead path using the cluster-based QoS algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
  15. 15

    Implementation of swarm intelligence algorithms on mobile robots by Kong, Zhung Jie

    Published 2017
    “…A target point is set and three paths made from different colours are used to guide the mobile robots towards the target point. …”
    Get full text
    Get full text
    Get full text
    Undergraduates Project Papers
  16. 16

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

    Development of low power viterbi decoder on complex programmable logic device platform by Abu, Mohd Azlan

    Published 2018
    “…This especially has been used in a noisy digital communication system such as wireless communication. …”
    Get full text
    Get full text
    Get full text
    Thesis
  18. 18

    Fair and fit resource allocation algorithm for network-controlled device-to-device (D2D) communication / Yusmardiah Yusuf, Darmawaty Mohd. Ali and Roslina Mohamad by Yusuf, Yusmardiah, Mohd. Ali, Darmawaty, Mohamad, Roslina

    Published 2021
    “…In this paper, a Fair and Fit Resource Allocation (FFRA) algorithm is proposed which exploits the path loss experienced by the potential D2D user equipments (UEs) when choosing the communication path. …”
    Get full text
    Get full text
    Get full text
    Article
  19. 19
  20. 20