Search Results - (( using discretization path algorithm ) OR ( java implication tree algorithm ))

Refine Results
  1. 1

    Indoor global path planning based on critical cells using dijkstra algorithm by Azrul Amri, Jamal, Engku Fadzli Hasan, Syed Abdullah, Fatma Susilawati, Mohamad

    Published 2015
    “…The algorithm uses floor plan of any environment discretized to some equal-sized square grids. …”
    Get full text
    Get full text
    Article
  2. 2

    Artificial bee colony algorithm with proposed discrete nearest neighborhood algorithm for discrete optimization problems by Rahimi, Amir Masoud, Ramezani-Khansari, Ehsan

    Published 2021
    “…This study seeks to solve this problem using Artificial Bee Colony (ABC) Algorithm along with the proposed Discrete Nearest Neighborhood Algorithm (DNNA). …”
    Get full text
    Get full text
    Get full text
    Article
  3. 3

    Performance of Ad-Hoc on-Demand Distance Vector Discovery Algorithms Based On Packet Lifetime by Ahmad, Noor Azlan

    Published 2008
    “…The performance analysis of the proposed algorithms was conducted by using the discrete-event simulator, OMNeT++. …”
    Get full text
    Get full text
    Thesis
  4. 4

    African Buffalo Optimization (ABO): A New Metaheuristic Algorithm by Odili, Julius Beneoluchi, M. N. M., Kahar

    Published 2015
    “…The African Buffalo Optimization (A.B.0) algorithm simulates the African buffalos' behaviour by encapsulation in a mathematical model; which solves a number of discrete optimization problems using graph-based route planning, job scheduling and it extends Swarm Intelligence paradigms. …”
    Get full text
    Get full text
    Get full text
    Article
  5. 5
  6. 6

    Simulated Kalman Filter algorithms for solving optimization problems by Nor Hidayati, Abdul Aziz

    Published 2019
    “…The proposed population-based SKF algorithm and the single solution-based SKF algorithm use the scalar model of discrete Kalman filter algorithm as the search strategy to overcome these flaws. …”
    Get full text
    Get full text
    Thesis
  7. 7

    Fair and fit resource allocation algorithm for network-controlled device-to-device (D2D) communication / Yusmardiah Yusuf, Darmawaty Mohd. Ali and Roslina Mohamad by Yusuf, Yusmardiah, Mohd. Ali, Darmawaty, Mohamad, Roslina

    Published 2021
    “…In this paper, a Fair and Fit Resource Allocation (FFRA) algorithm is proposed which exploits the path loss experienced by the potential D2D user equipments (UEs) when choosing the communication path. …”
    Get full text
    Get full text
    Get full text
    Article
  8. 8

    Traffic management algorithms for LEO satellite networks by Huyop @ Ayop, Fahrul Hakim

    Published 2016
    “…In order to evaluate the proposed algorithm, a series of experiments to implement Discrete Event Simulation (DES) of a LEO satellite network by using ns-2 and C/C++ are conducted. …”
    Get full text
    Get full text
    Get full text
    Thesis
  9. 9

    Design And Development Of Collision Avoidance Strategy For Differential Drive Mobile Robot by Ng, Sing Yee

    Published 2018
    “…For path planning strategy, the dead-reckoning method is developed to calculate the speed and position control of the robot while discrete proportional-integral (PI) controllers are used to regulate the velocities of both wheels. …”
    Get full text
    Get full text
    Monograph
  10. 10

    Robot path planning using family of SOR iterative methods with laplacian behaviour-based control by Azali Saudi

    Published 2015
    “…This study proposed a robot path planning technique that relies on the use of Laplace's equation to constrain the generation of potential values. …”
    Get full text
    Get full text
    Get full text
    Thesis
  11. 11

    Predetermined path of mobile data gathering in wireless sensor networks based on network layout by Ghaleb, Mukhtar, Subramaniam, Shamala, Othman, Mohamed, Ahmad Zulkarnain, Zuriati

    Published 2014
    “…The ME will select a centroid point between two sub-polling points, subsequently selecting common turning points as the core of the basis of the tour path. Extensive discrete-event simulations have been developed to assess the performance of the proposed algorithm. …”
    Get full text
    Get full text
    Article
  12. 12

    Using artificial intelligence search in solving the camera placement problem by Altahir, A.A., Asirvadam, V.S., Hamid, N.H.B., Sebastian, P.

    Published 2022
    “…Two case studies are used to evaluate those algorithms, and the camera placement problem is formulated as a coverage maximization problem. …”
    Get full text
    Get full text
    Book
  13. 13
  14. 14

    Improvement and application of particle swarm optimization algorithm by Deevi, Durga Praveen, Kodadi, Sharadha, Allur, Naga Sushma, Dondapati, Koteswararao, Chetlapalli, Himabindu, Perumal, Thinagaran

    Published 2025
    “…Most real-world optimization problems are nonlinear and discrete with local constraints. The PSO algorithm encounters issues such as inefficient solutions and early convergence. …”
    Get full text
    Get full text
    Article
  15. 15
  16. 16

    An enhanced swap sequence-based particle swarm optimization algorithm to solve TSP by Bibi Aamirah Shafaa Emambocus, Muhammed Basheer Jasser, Muzaffar Hamzah, Aida Mustapha, Angela Amphawan

    Published 2021
    “…The proposed algorithm is found to provide better solutions with shorter paths when applied to TSP as compared to swap sequence based PSO. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  17. 17

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

    Published 2021
    “…One of the proposals that could help solve this problem is the use of brain-computer interface (BCI)s. Brain-Computer Interface (BCI) can be used as a direct communication path between the brain and an external device. …”
    Get full text
    Thesis
  18. 18

    Fuzzy logic based link status classification for efficient multipath routing in multi-hop wireless mesh networks by Shah, P.A., Hasbullah, H.B., Rafique, S., Rehman, S.U., Jung, L.T.

    Published 2014
    “…On the basis of link status, said algorithm predicts in advance that a particular link, on the active path between sender and receiver, is about to break and helps the reactive multipath routing protocol to start the rerouting operation, thus minimizing the route discovery frequency, delay and packet loss. …”
    Get full text
    Get full text
    Conference or Workshop Item
  19. 19
  20. 20

    Simulated Kalman Filter with modified measurement, substitution mutation and hamming distance calculation for solving traveling salesman problem by Suhazri Amrin, Rahmad, Zuwairie, Ibrahim, Zulkifli, Md. Yusof

    Published 2022
    “…We reviewed 57 SKF papers. 16 of them on fundamental improvements, 9 on extension of the algorithm to discrete problems and 25 on their applications. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item