Search Results - (( java simulation optimization algorithm ) OR ( dynamic location path algorithm ))

Refine Results
  1. 1

    New algorithm for autonomous dynamic path planning in real-time intelligent robot car by Mohammed, Akeel Ahmed, Hassan, Mohd Khair, Aris, Ishak, Kamsani, Noor Ain

    Published 2017
    “…Through the use of modified A* algorithm, the optimal path with a minimum cost can be determined and an efficient execution time of moving from a starting location to a target location in a dynamic environment can be achieved. …”
    Get full text
    Get full text
    Get full text
    Article
  2. 2
  3. 3
  4. 4

    Modification of dijkstra's algorithm for safest and shortest path during emergency evacuation by Khyrina Airin Fariza, Abu Samah, Burairah, Hussin, Abd Samad, Hasan Basari

    Published 2015
    “…It uses modified Dijkstra's algorithm in order to incorporate both aspects and considering the hazardous location. …”
    Get full text
    Get full text
    Get full text
    Article
  5. 5

    Visual servo algorithm of robot arm simulation for dynamic tracking and grasping application by Rishi Arran Suppramaniam, Mohd Hairi Mohd Zaman, Mohd Faisal Ibrahim, Seri Mastura Mustaza, Asraf Mohamed Moubark

    Published 2022
    “…Future works are required to improve the dynamic visual servo algorithm with motion planning when obstacles are present in the path of robot grasping.…”
    Get full text
    Get full text
    Get full text
    Article
  6. 6

    A Modified Route Discovery Approach For Dynamic Source Routing (DSR) Protocol In Mobile Ad-Hoc Networks by Allahham, Alaa Azmi, Mohammed, Muamer N.

    Published 2017
    “…There are many types of routing protocols that operate within MANET networks, which responsible for finding paths between the source and destination nodes with the modernization of these paths which are constantly changing due to the dynamic topology of the network stemming from the constant random movement of the nodes. …”
    Get full text
    Get full text
    Get full text
    Article
  7. 7

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

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

    Attack graph construction for enhancing intrusion prediction based on vulnerabilities metrics by Al-Araji, Zaid Jasim Mohammed

    Published 2023
    “…This study employs use Random Forest algorithm to identify and forecast attacks to dynamically locate the attack location in the network for attack graph analysis. …”
    Get full text
    Get full text
    Get full text
    Thesis
  10. 10

    Solving vehicle routing problem by using improved K-nearest neighbor algorithm for best solution by Mohammed, Mazin Abed, Abd Ghani, Mohd Khanapi, Hamed, Raed Ibraheem, A. Mostafa, Salama, Ahmed Ibrahim, Dheyaa, Jameel, Humam Khaled, Alallah, Ahmed Hamed

    Published 2017
    “…Objectives: Our paper attempt to find an optimal route result for VRP by using K-Nearest Neighbor Algorithm (KNNA). To achieve an optimal solution for VRP with the accompanying targets: (1) To reduce the distance and the time for all paths this leads to speedy the transportation of customers to their locations, (2) To implement the capacitated vehicle routing problem (CVRP) model for optimizing the solutions. …”
    Get full text
    Get full text
    Get full text
    Article
  11. 11

    A new multicast-based architecture to support host mobility in IPv6 by M. Ali, Borhanuddin, Habaebi, Mohamed Hadi, AI-Talib, Sahar

    Published 2003
    “…The mechanism is based on hash algorithm. This paper explains the construction of a dynamic delivery tree of the mobile node movement for a multicast-based mobile IPv6 network, such that the branches of the tree constitute the shortest paths from the packet source to each of the visited locations. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  12. 12

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

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

    A new multicast-based architecture to support host mobility in IPv6 by Mohd Ali, Borhanuddin, Habaebi, Mohamed Hadi, Al-Talib, Sahar Abdul Aziz

    Published 2003
    “…The mechanism is based on hash algorithm. This paper explains the construction of a dynamic delivery tree of the mobile node movement for a multicast-based mobile IPv6 network, such that the branches of the tree constitute the shortest paths from the packet source to each of the visited locations. …”
    Get full text
    Get full text
    Conference or Workshop Item
  15. 15

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

    Attack prediction to enhance attack path discovery using improved attack graph by Al-Araji, Zaid Jasim, Abdullah, Raihana Syahirah, Syed Ahmad, Sharifah Sakinah

    Published 2022
    “…For the attack graph analysis, the random forest algorithm was used to detect, predict, and dynamically ascertain the attack location in the network. …”
    Get full text
    Get full text
    Get full text
    Article
  17. 17

    Autonomous Navigation Robot using Slam and Path Planning Based on a Single RP-LIDAR by Shamsudin, Abu Ubaidah, Mohd Sharif, Puteri Alisha Balqis, Adil Soomro, Zubair, Abdul Rahim, Ruzairi, Mohd Faudzi, Ahmad Athif, Wan Zakaria, Wan Nurshazwani, Peeie, Mohamad Heerwan, Salaan, Carl John

    Published 2025
    “…The approach was evaluated in a laboratory environment (11 meter by 8 meter) and successfully built a path that avoided obstacles in both static and dynamic conditions. …”
    Get full text
    Get full text
    Get full text
    Article
  18. 18

    Dynamic object replica placement using underlying routing protocols: ensuring the reliability by Waqas, Ahmad, Majeed, Nahdia, Muhammed Yusof, Zulkefli, Wahees Mahesar, Abdul

    Published 2013
    “…The issues of choosing the best path for placing the replica that provides the minimum latency and reliability of contents transmission can be overcome by combining the EIGRP features that includes internetwork delay, bandwidth consumption, reliability of packet transmission and traffic load, with dynamic replica placement algorithm.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  19. 19

    Wormhole attack detection mechanism in mobile ad hoc network using neighborhood information and path tracing algorithm by Enshaei, Mehdi

    Published 2015
    “…Throughput and packet overhead is improved in the NIPT algorithm with an average of 4% and 6% respctively over the PT algorithm. …”
    Get full text
    Get full text
    Thesis
  20. 20

    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