Search Results - (( time evaluation path algorithm ) OR ( probable distribution function algorithm ))

Refine Results
  1. 1

    An empirical study of density and distribution functions for ant swarm optimized rough reducts by Pratiwi, Lustiana, Choo, Yun Huoy, Draman @ Muda, Azah Kamilah

    Published 2011
    “…To describe relative probability of different random variables, Probability Density Function (PDF) and the Cumulative Density Function (CDF) are capable to specify its own characterization of Gaussian distributions. …”
    Get full text
    Get full text
    Get full text
    Book Chapter
  2. 2

    A Comparative Performance Analysis of Gaussian Distribution Functions in Ant Swarm Optimized Rough Reducts by Pratiwi, Lustiana, Choo, Yun Huoy, Draman @ Muda, Azah Kamilah

    Published 2011
    “…Coexistence, cooperation, and individual contribution to food searching by a particle (ant) as a swarm (ant) survival behavior, depict the common characteristics of both algorithms. Solution vector of ACO is presented by implementing density and distribution function to search for a better solution and to specify a probability functions for every particle (ant). …”
    Get full text
    Get full text
    Article
  3. 3
  4. 4
  5. 5

    Performance analysis of genetic algorithm (GA)-based multi-constrained path routing algorithm by Yussof S.

    Published 2023
    “…The performance of the algorithm is then compared with an exact algorithm called the depth first search and a common shortest path algorithm called the Dijkstra's algorithm. …”
    Article
  6. 6

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

    Shortest Path Trajectory System Based on Dijkstra Algorithm by Putri, Indah Pratiwi

    Published 2012
    “…This project aims to determine locations of the node that reflect all the items in the list, build the route by connecting nodes and evaluate the proposed algorithm for the single source shortest path problem. …”
    Get full text
    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
    “…Definitely this best first search algorithm saves the searching time and improves performance of shortest path finding.…”
    Get full text
    Get full text
    Thesis
  11. 11

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

    Some families of count distributions for modelling zero-inflation and dispersion / Low Yeh Ching by Low, Yeh Ching

    Published 2016
    “…The probability function of the counts is often complicated thus a method using numerical Laplace transform inversion for computing the probabilities and the renewal function is proposed. …”
    Get full text
    Get full text
    Thesis
  13. 13

    Cash-flow analysis of a wind turbine operator by Muhamad Razali N.M., Hashim A.H.

    Published 2023
    “…Two-parameter Weibull type probability density function (PDF) is used to model wind profile at two locations. …”
    Conference Paper
  14. 14

    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
    “…The problem is to find the global path that satisfies the optimization criteria, which are shorter path length and less computation time. …”
    Get full text
    Get full text
    Thesis
  15. 15

    Multi-Objective Hybrid Algorithm For The Classification Of Imbalanced Datasets by Saeed, Sana

    Published 2019
    “…Thereafter, a multi-objective hybrid algorithm (MOHA), an extension of the self-adaptive hybrid algorithm is proposed and tested on the established multi-objective (MO) test functions. …”
    Get full text
    Get full text
    Thesis
  16. 16

    Fair bandwidth distribution marking and scheduling algorithm in network traffic classification by Al-Kharasani, Ameen Mohammed Abdulkarem

    Published 2019
    “…Finally, propose a new method of obtaining optimal parameters dropping functions for Random Early Detection (RED) algorithm. …”
    Get full text
    Get full text
    Thesis
  17. 17

    Performance comparison of a and Dijkstra algorithms with bézier curve in 2D grid and OpenStreetMap scenarios by Yusuf, Zakariah, Mohamad, Sufian, Wan Ibrahim, Wan Suhaifiza

    Published 2025
    “…The evaluation focused on three key performance metrics: computational efficiency, path smoothness, and the number of turns. …”
    Get full text
    Get full text
    Get full text
    Article
  18. 18

    Real-Time Optimal Trajectory Correction (ROTC) for autonomous quadrotor / Noorfadzli Abdul Razak by Abdul Razak, Noorfadzli

    Published 2018
    “…However, existing algorithm seems too complicated to be applied. Since there is no technique can enable the quadrotor to implement precision navigation application, the research proposed a Real-Time Optimal Trajectory Correction (ROTC) algorithm. …”
    Get full text
    Get full text
    Thesis
  19. 19

    Determination of dengue hemorrhagic fever disease factors using neural network and genetic algorithms / Yuliant Sibaroni, Sri Suryani Prasetiyowati and Iqbal Bahari Sudrajat by Yuliant, Sibaroni, Sri Suryani, Prasetiyowati, Iqbal Bahari, Sudrajat

    Published 2020
    “…Determination of the best factor is carried out in a genetic algorithm by combining several parameters of the crossover probability (Pc) and mutation probability (Pm). …”
    Get full text
    Get full text
    Get full text
    Article
  20. 20

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

    Published 2024
    “…By contrast, the running time of the safe path selection model (96 µs) is shorter than the running times of Dijkstra's algorithm and the Floyd- Warshall algorithm (150 µs and 184 µs, respectively). …”
    thesis::doctoral thesis