Search Results - (( using function max algorithm ) OR ( a constructive path algorithm ))

Refine Results
  1. 1

    Autonomous path planning through application of rotated two-parameter overrelaxation 9-point Laplacian iteration technique by W. K. Ling, A. A. Dahalan, Azali Saudi

    Published 2020
    “…The harmonic functions are an appropriate method to be used on autonomous path planning because it satisfies the min-max principle, therefore avoiding the occurrence of local minima which traps robot’s movements, and that it offers complete path planning algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  2. 2

    Maximum 2-satisfiability in radial basis function neural network by Shehab Abdulhabib Alzaeemi, Saratha Sathasivam, Mohd Shareduwan Mohd Kasihmuddin, Mohd. Asyraf Mansor

    Published 2020
    “…This paper presents a new paradigm in using MAX2SAT by implementing in Radial Basis Function Neural Network (RBFNN). …”
    Get full text
    Get full text
    Get full text
    Article
  3. 3
  4. 4

    Statistical data preprocessing methods in distance functions to enhance k-means clustering algorithm by Dalatu, Paul Inuwa

    Published 2018
    “…We introduced two new approaches to normalization techniques to enhance the K-Means algorithms. This is to remedy the problem of using the existing Min-Max (MM) and Decimal Scaling (DS) techniques, which have overflow weakness. …”
    Get full text
    Get full text
    Get full text
    Thesis
  5. 5

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

    Published 2022
    “…Path planning refers to a robot's search for a collision-free and optimal path from a start point to a predefined goal position in a given environment. …”
    Get full text
    Thesis
  6. 6

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

    Published 2013
    “…Sampling-based motion planning is a class of randomized path planning algorithms with proven completeness. …”
    Get full text
    Get full text
    Thesis
  7. 7

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

    Effective downlink resource management for wimax networks by Shareef, Zayd Ashraf Najeeb

    Published 2018
    “…Our EDRM framework involves three functions: Class-Based Scheduling (CBS) algorithm, Dynamic Bandwidth Allocation (DBA) scheme and Link Session Management (LSM) policy. …”
    Get full text
    Get full text
    Thesis
  9. 9

    Performance comparison between genetic algorithm and ant colony optimization algorithm for mobile robot path planning in global static environment / Nohaidda Sariff by Sariff, Nohaidda

    Published 2011
    “…In the initial stage, the test environments were constructed. Subsequently, both algorithms were applied to the test environments. …”
    Get full text
    Get full text
    Thesis
  10. 10
  11. 11

    Wi-fi fingerprint database construction using Chebyshev wavelet functions by Narzullaev, Anvar, Nemadaliev, Azamjon, Selamat, Mohd Hasan, Othman, Mohamed, Sharif, Khaironi Yatim

    Published 2015
    “…Our algorithm requires only a few samples to be collected in a given region, and thus significantly reduces the calibration time. …”
    Get full text
    Get full text
    Conference or Workshop Item
  12. 12

    An efficient algorithm to improve oil-gas pipelines path by Hasan Almaalei, Nabeel Naeem, Mohd Razali, Siti Noor Asyikin, Mohammed Alduais, Nayef Abdulwahab

    Published 2018
    “…Therefore, the aim of this study is to propose a new algorithm to obtain the shortest path connecting oil-gas wells and addressing obstacles that may appear on the path connecting any two wells. …”
    Get full text
    Article
  13. 13

    Modern fuzzy min max neural networks for pattern classification by Al Sayaydeh, Osama Nayel Ahmad

    Published 2019
    “…To build an efficient classifier model, researchers have introduced hybrid models that combine both fuzzy logic and artificial neural networks. Among these algorithms, Fuzzy Min Max (FMM) neural network algorithm has been proven to be one of the premier neural networks for undertaking the pattern classification problems. …”
    Get full text
    Get full text
    Thesis
  14. 14
  15. 15

    The impact of clustering on the average path length in wireless sensor networks by Aziz, A.A., Şekercioğlu, Y. A.

    Published 2015
    “…Clustering algorithms have been widely used in wireless sensor networks for virtual backbone construction. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  16. 16

    Shortest path from Bandar Tun Razak to Berjaya Times Square using Dijkstra Algorithm / Nur Syuhada Muhammat Pazil ... [et al.] by Muhammat Pazil, Nur Syuhada, Mahmud, Norwaziah, Jamaluddin, Siti Hafawati, Mustafa, Nur Farasyaqirra

    Published 2020
    “…Nevertheless, both time and cost of shortest path are constructed in different paths. The time and cost of the journey are described by driving a car from Bandar Tun Razak to Lebuhraya SMART to Kampung Pandan, then Berjaya Times Square. …”
    Get full text
    Get full text
    Get full text
    Article
  17. 17
  18. 18

    Optimizing optimal path trace back for Smith-Waterman algorithm using structural modelling technique by Saliman, Nur Farah Ain

    Published 2012
    “…The optimizing of optimal path trace back system for Smith-Waterman algorithm using structural modelling techniques are presented in this paper. …”
    Get full text
    Get full text
    Student Project
  19. 19

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

    Published 2014
    “…However, when compositions contain more than one execution path (i.e., multiple path's compositions), it is difficult to generate a composite service that simultaneously optimizes all the execution paths involved in the composite service at the same time while meeting the QoS requirements. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  20. 20

    Design and analysis of construction and recombination module using Idury Waterman Algorithm for fragment assembly application / Hafifi Mohd Rafi by Mohd Rafi, Hafifi

    Published 2012
    “…There is several algorithms use in sequencing of DNA fragment. This paper presents a study on design and analysis of construction and recombination module using IduryWaterman algorithm and fragment assembly application using Verilog. …”
    Get full text
    Get full text
    Thesis