Search Results - (( developing test path algorithm ) OR ( java simulation optimization algorithm ))

Refine Results
  1. 1

    Automated path testing using the negative selection algorithm by Shayma Mustafa Mohi-Aldeen, Radziah Mohamad, Safaai Deris

    Published 2017
    “…Negative selection algorithm (NSA) has been used in this paper to generate test data for path testing automatically. …”
    Get full text
    Get full text
    Indexed Article
  2. 2
  3. 3

    The Development Of A Robust Algorithm For Uav Path Planning In 3d Environment by Kok, Kai Yit

    Published 2016
    “…Thus, a new algorithm known as infection evolution (IE) was developed in this study. …”
    Get full text
    Get full text
    Thesis
  4. 4

    A generalized laser simulator algorithm for optimal path planning in constraints environment by Aisha, Muhammad

    Published 2022
    “…This research focuses on developing a novel path planning algorithm, called Generalized Laser Simulator (GLS), to solve the path planning problem of mobile robots in a constrained environment. …”
    Get full text
    Thesis
  5. 5

    Repetitive mutations in genetic algorithm for software test data generations by Kadhim, Mohammed Majid

    Published 2022
    “…One of the white box testing techniques is path coverage testing. Genetic Algorithm (GA) has proven to be an important method in generating test data for automatic path coverage testing. …”
    Get full text
    Get full text
    Thesis
  6. 6

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

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

    Meta-Heuristic Algorithms for Learning Path Recommender at MOOC by Son, N.T., Jaafar, J., Aziz, I.A., Anh, B.N.

    Published 2021
    “…We have developed Metaheuristic algorithms includes the Genetic Algorithm (GA) and Ant Colony Optimization Algorithm (ACO), to solve the proposed model. …”
    Get full text
    Get full text
    Article
  9. 9

    Test case generation from state machine with OCL constraints using search-based techniques / Aneesa Ali Ali Saeed by Aneesa Ali, Ali Saeed

    Published 2017
    “…The second contribution of this thesis is developing an accurate search-based test data generator for generating automatically optimal test data to satisfy the whole constraints in the path. …”
    Get full text
    Get full text
    Get full text
    Thesis
  10. 10

    Simulation of shortest path using a-star algorithm / Nurul Hani Nortaja by Nurul Hani , Nortaja

    Published 2004
    “…The steps to calculate a shortest path using A • algorithm is shown by using appropriate examples and related figures. …”
    Get full text
    Get full text
    Thesis
  11. 11
  12. 12
  13. 13

    Mobile robot path optimization algorithm using vector calculus and mapping of 2 dimensional space by Zahari, Ammar, Ismail , Amelia Ritahani, Desia, Recky

    Published 2015
    “…A simulated robot in a simulated environment is used to test the algorithm that is to be developed. The simulated robot is equipped with a sonar sensor and several infrared sensors on its chassis. …”
    Get full text
    Get full text
    Get full text
    Article
  14. 14

    Investigating and developing the best method in shortest path for implementing a geographical information system (e-map) for Peninsular Malaysia by Ahmad, Ab. Rahman, Zenon , Nasaruddin, Hassan, Haswadi

    Published 2005
    “…There are many algorithms have been designed to find these paths. The algorithms such as Djikstra, Bellman-Ford or Floyd- Warshall are difference from one to another due to the simplicity, effectiveness and duration of processing the nodes. …”
    Get full text
    Get full text
    Monograph
  15. 15

    Autonomous mobile robot: Path planning using backward chaining by I.M., Nawi, M.A.S.A., Rahim

    Published 2008
    “…Obstacle avoidance and path planning algorithms has been tested using the completed design of AMR body. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  16. 16

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

    A generalized laser simulator algorithm for mobile robot path planning with obstacle avoidance by Muhammad, Aisha, Ali, Mohammed A.H., Turaev, Sherzod, Abdulghafor, Rawad Abdulkhaleq Abdulmolla, Shanono, Ibrahim Haruna, Alzaid, Zaid, Alruban, Abdulrahman, Alabdan, Rana, Dutta, Ashit Kumar, Almotairi, Sultan

    Published 2022
    “…With application of the all-direction border scan, it outperforms the A-star (A*) and PRM algorithms and provides safer and shorter paths. Furthermore, the path planning approach was validated for local planning in simulation and real-world tests, in which the proposed method produced the best path compared to the original LS algorithm.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  18. 18

    Graph processing hardware accelerator for shortest path algorithms in nanometer very large-scale integration interconnect routing by Ch'ng, Heng Sun

    Published 2007
    “…This thesis proposes a graph processing hardware accelerator for shortest path algorithms applied in nanometer VLSI interconnect routing problems. …”
    Get full text
    Get full text
    Get full text
    Thesis
  19. 19

    Mobile First-Person Shooter (FPS) Game Using Basic Theta* Algorithm / Muhammad Syurahbil Abd Rohaman by Abd Rohaman, Muhammad Syurahbil

    Published 2020
    “…The most common pathfinding algorithm used in video game is A*. Even though A* is the most popular algorithm amongst game developers, it's hardly the best algorithm in finding the true shortest path. …”
    Get full text
    Get full text
    Thesis
  20. 20

    Novel algorithm for mobile robot path planning in constrained environment by Muhammad, Aisha, Ali, Mohammed A. H., Turaev, Sherzod, Shanono, Ibrahim Haruna, Hujainah, Fadhl, Mohd Zubir, Mohd Nashrul, Faiz, Muhammad Khairi, Mohd Faizal, Erma Rahayu, Abdulghafor, Rawad Abdulkhaleq Abdulmolla

    Published 2021
    “…This paper presents a development of a novel path planning algorithm, called Generalized Laser simulator (GLS), for solving the mobile robot path planning problem in a two-dimensional map with the presence of constraints. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article