Search Results - (( simulation classification using algorithm ) OR ( using selection path 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

    A Hybrid of Ant Colony Optimization Algorithm and Simulated Annealing for Classification Rules by Rizauddin, Saian

    Published 2013
    “…Thus, this thesis proposed two variants of hybrid ACO with simulated annealing (SA) algorithm for solving problem of classification rule induction. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  3. 3
  4. 4

    Optimisation of Environmental Risk Assessment Architecture using Artificial Intelligence Techniques by Salem S. M. Khalifa

    Published 2024
    “…By contrast, the results of the safe path selection model were compared with the results obtained using Dijkstra's algorithm and the Floyd-Warshall algorithm. …”
    thesis::doctoral thesis
  5. 5

    Path planning for unmanned aerial vehicles using visibility line-based methods by Omar, Rosli

    Published 2011
    “…The proposed 2D path planning algorithms, on the contrary, select a relatively smaller number of vertices using the so-called base line (BL), thus they are computationally efficient. …”
    Get full text
    Get full text
    Thesis
  6. 6

    Optimal QoS aware multiple paths web service composition using heuristic algorithms and data mining techniques by Qtaish, Osama Kayed Taher

    Published 2014
    “…Second, both the constructive procedure (CP) and the complementary procedure (CCP) heuristic algorithms computed the optimization considering only the execution path that has been predicted by the runtime path prediction method for criteria selection, eight QoS characteristics are suggested after investigating related works on the area of web service and web service composition. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  7. 7

    A novel Bezier curve control point search algorithm for autonomous navigation using N-order polynomial search with boundary conditions by Sajith, Akhil Vinayak, Zakaria, M. A., Baarath, K., Anwar, P. P. Abdul Majeed

    Published 2021
    “…However, the Bezier curve is the most widely used in the curve fitting algorithm for vehicle path planning as it can generate a possible number of path maneuvers. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  8. 8

    Selection and optimization of peak features for event-related eeg signals classification / Asrul bin Adam by Asrul, Adam

    Published 2017
    “…At first, a peak classification algorithm is developed based on the general following processes including peak candidate identification, feature extraction, and classification. …”
    Get full text
    Get full text
    Get full text
    Thesis
  9. 9

    Route optimization using shortest path method / Muhamad Faisal Amin Shakri by Shakri, Muhamad Faisal Amin

    Published 2025
    “…This study investigated the implementation and comparison between well known shortest path method which are Dijkstra’s algorithm, Bellman-Ford, and A* algorithm. …”
    Get full text
    Get full text
    Thesis
  10. 10

    A Continuous Overlay Path Probing Algorithm For Overlay Networks by Feily, Maryam

    Published 2013
    “…Such an in-band probing algorithm reduces measurement overhead on the selected overlay path. …”
    Get full text
    Get full text
    Thesis
  11. 11

    Ant colony optimization for rule induction with simulated annealing for terms selection by Saian, Rizauddin, Ku-Mahamud, Ku Ruhana

    Published 2012
    “…This paper proposes a sequential covering based algorithm that uses an ant colony optimization algorithm to directly extract classification rules from the data set.The proposed algorithm uses a Simulated Annealing algorithm to optimize terms selection, while growing a rule.The proposed algorithm minimizes the problem of a low quality discovered rule by an ant in a colony, where the rule discovered by an ant is not the best quality rule, by optimizing the terms selection in rule construction. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  12. 12

    Path planning for visually impaired people in an unfamiliar environment using particle swarm optimization by Yusof, T. S. T., Toha, Siti Fauziah, Md. Yusof, Hazlina

    Published 2015
    “…Here, in this paper, we propose a path planning with predetermined waypoints method using Particle Swarm Optimization (PSO) algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
  13. 13

    An improved pixel-based and region-based approach for urban growth classification algorithms / Nur Laila Ab Ghani by Ab Ghani, Nur Laila

    Published 2015
    “…The forms of urban growth can be simulated using satellite remote sensing data and suitable classification technique. …”
    Get full text
    Get full text
    Thesis
  14. 14

    A hybrid sampling-based path planning algorithm for mobile robot navigation in unknown environments by Khaksar, Weria

    Published 2013
    “…These algorithms generate paths using random numbers and perform efficiently in guiding the robot in known environments. …”
    Get full text
    Get full text
    Thesis
  15. 15

    Shortest Path Routing Using Heuristic Search by Alaiwan, Ahmed Omran A.

    Published 2006
    “…In this project A* algorithm was used, to suggest shortest path model between two selected points to find the fastest and shortest route on Malaysia map. …”
    Get full text
    Get full text
    Get full text
    Thesis
  16. 16

    Integration of enchanced jump point search (JPS) algorithm with modified bresenham technique for path planning in virtual grid-based environment by Nurul Atikah Janis

    Published 2018
    “…The second approach is the modification of heuristic computation using original A* and modified Bresenham. Bresenham Line Algorithm is a line generation algorithm using integer arithmetic where the points (x1, y1) and (x2, y2) are assumed not equal and integer valued. …”
    Get full text
    Get full text
    Get full text
    Thesis
  17. 17

    An Analysis Of Various Algorithms For Text Spam Classification And Clustering Using Rapidminer And Weka by Zainal K., Sulaiman N.F., Jali M.Z.

    Published 2024
    “…By using the same dataset, which is downloaded from UCI, Machine Learning Repository, various algorithms used in classification and clustering in this simulation has been analysed comparatively. …”
    Article
  18. 18

    Evaluation of robot path planning algorithms in global static environments: genetic algorithm vs ant colony optimization algorithm / Nohaidda Sariff and Norlida Buniyamin by Sariff, Nohaidda, Buniyamin, Norlida

    Published 2010
    “…Performances between both algorithms were compared and evaluated in terms of speed and number of iterations that each algorithm takes to find an optimal path within several selected environments. …”
    Get full text
    Get full text
    Get full text
    Article
  19. 19

    Attack path selection optimization with adaptive genetic algorithms by Abd Rahman, A.S., Zakaria, M.N., Masrom, S.

    Published 2016
    “…Attack paths that satisfy certain optimization criteria are then selected and presented as possible components of the security solution. …”
    Get full text
    Get full text
    Article
  20. 20

    Attack path selection optimization with adaptive genetic algorithms by Abd Rahman, A.S., Zakaria, M.N., Masrom, S.

    Published 2016
    “…Attack paths that satisfy certain optimization criteria are then selected and presented as possible components of the security solution. …”
    Get full text
    Get full text
    Article