Search Results - (( using classification using algorithm ) OR ( using selection path algorithm ))

Refine Results
  1. 1

    Using graph algorithm and classification technique for finding an optimal bus route in time-dependent travel times by Deelertmongkolchai, Satjayod, Chumwatana, Todsanai, Thaiupathump, Choonhapong

    Published 2016
    “…The proposed technique is able to find a least spent travel time path between two nodes in a bus network with time-dependence.Graph algorithm is used to generate all possible paths to reveal the distances.Classification technique is then used to analysis traffic situation in different period of the time.By analysis traffic situation, date, time, week, month, location are used as a main factor for training process in classification technique.From the experimental studies, the proposed technique is able to show the best route from any given node to the final destination depending on the different period of the time.The proposed technique provides significant benefit for traveler to select the best bus route, which is short distance and fast, among generated routes…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  2. 2

    Review of Nature Inspired Metaheuristic Algorithm Selection for Combinatorial t-way Testing by Muazu, A.A., Hashim, A.S., Sarlan, A.

    Published 2022
    “…The purpose of this review is to revisit and carry out up-to-date review on these distinguished algorithms with their respective current state of use. …”
    Get full text
    Get full text
    Article
  3. 3

    Applying SAX-based time series analysis to classify EEG signal using a COTS EEG device by Shanmuga, Pillai A/L Murutha Muthu

    Published 2021
    “…The main motivation of this study is to find out techniques that may improve EEG signal classification. SAX algorithm may bring improvement to classic time series classification, so we investigate it`s impact on EEG signal classification. …”
    Get full text
    Thesis
  4. 4

    Classification and quantification of palm oil adulteration via portable NIR spectroscopy by Basri, Katrul Nadia, Hussain, Mutia Nurulhusna, Bakar, Jamilah, Sharif, Zaiton, Abdul Khir, Mohd Fared, Zoolfakar, Ahmad Sabirin

    Published 2017
    “…Pure and adulterated palm oil sample were classified using soft independent modeling class analogy (SIMCA) algorithm with model accuracy more than 0.95 reported for both transflectance and transmission modes. …”
    Get full text
    Get full text
    Get full text
    Article
  5. 5

    Classification and quantification of palm oil adulteration via portable NIR spectroscopy by Basri, Katrul Nadia, Hussain, Mutia Nurulhusna, Bakar, Jamilah, Sharif, Zaiton and, Zoolfakar, Ahmad Sabirin, Mohd Fared Abdul Khir

    Published 2024
    “…Pure and adulterated palm oil sample were classified using soft independent modeling class analogy (SIMCA) algorithm with model accuracy more than 0.95 reported for both transflectance and transmission modes. …”
    Article
  6. 6
  7. 7
  8. 8

    LED based NIR spectroscopy for detection of lard adulteration in palm oil via chemometrics / Katrul Nadia Basri by Basri, Katrul Nadia

    Published 2017
    “…Pure and adulterated palm oil sample were classified using soft independent modeling class analogy (SIMCA) algorithm with model accuracy more than 0.95 reported for both transflectance and transmission modes. …”
    Get full text
    Get full text
    Thesis
  9. 9

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

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

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

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

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

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

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

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

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

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

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

    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