Search Results - intelligence _ ((((graph algorithm) OR (path algorithm))) OR (tree algorithm))

Refine Results
  1. 1

    A Robust Graph Theoretic Solution of Routing in Intelligent Networks by Qureshi, M.A., Hassan, M.F., Ehsan, M.K., Khan, M.O., Ali, M.Y., Khan, S.

    Published 2022
    “…The fast construction of shortest-path tree (SPT) is important to devise an efficient routing in a nondelay tolerant networks. …”
    Get full text
    Get full text
    Article
  2. 2

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

    Published 2015
    “…This paper proposes a new meta-heuristic approach to solving numerical and graph-based problems. The African buffalo algorithm evolved from an understanding of the animal's survival instincts and the search techniques they utilize in the African forests and savannahs; the search for the optimal path to pasture is aligned to their cooperative, intelligent, and social nature. …”
    Get full text
    Get full text
    Get full text
    Article
  3. 3

    Industry 5.0 and Education 5.0: Transforming Vocational Education through Intelligent Technology by Zhang, Hongli, Leong, Wai Yie

    Published 2024
    “…By analyzing the research gaps in personalized learning paths, emotion-driven learning, crossdisciplinary integration, and long-term learning behavior analysis, the paper proposes four improved algorithms: the adaptive learning path generation algorithm, the emotion-driven personalized learning algorithm, the cross-disciplinary knowledge graph algorithm, and the long-term learning behavior prediction algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  4. 4
  5. 5

    Attack graph construction for enhancing intrusion prediction based on vulnerabilities metrics by Al-Araji, Zaid Jasim Mohammed

    Published 2023
    “…For this issue, this study proposes using intelligent agents to reduce the reachability time in calculating between the nodes and use the naïve approach prune algorithm to remove unnecessary edges, minimizing the attack graph's complexity. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  6. 6

    A comprehensive overview of classical and modern route planning algorithms for self-driving mobile robots by Wan Daud, Wan Mohd Bukhari, Abu, Nur Syuhadah, Omar, Siti Nashayu, Sohaimeh, Shahirul Ashraf, Adli,, M. H.

    Published 2022
    “…This evaluation focuses mostly on the accuracy of the different path-planning algorithms. Common collision-free path planning methodologies are examined in this paper, including classical or traditional and modern intelligence techniques, as well as both global and local approaches, in static and dynamic environments. …”
    Get full text
    Get full text
    Get full text
    Article
  7. 7

    Attack prediction to enhance attack path discovery using improved attack graph by Al-Araji, Zaid Jasim, Abdullah, Raihana Syahirah, Syed Ahmad, Sharifah Sakinah

    Published 2022
    “…In order to overcome this limitation, this present study recommends the use of intelligent agents to reduce reachability time by calculating between the nodes, as well as using the A*prune algorithm to remove useless edges and reduce attack graph complexity. …”
    Get full text
    Get full text
    Get full text
    Article
  8. 8
  9. 9

    Modeling of static and dynamic components of bio-nanorobotic systems by Gavgani, Hamidreza Khataee

    Published 2012
    “…In addition, a graph algorithm based on greedy methods is employed to compute a new set of optimal weighted electronic properties of the fullerenes via computing their Minimum Weight Spanning Trees (MWSTs). …”
    Get full text
    Get full text
    Thesis
  10. 10

    Utilization of Tabu search heuristic rules in sampling-based motion planning by Khaksar W., Hong T.S., Sahari K.S.M., Khaksar M.

    Published 2023
    “…We also compare the performance of the algorithm with some of the well-known path planning approaches, including Bug1, Bug2, PRM, RRT and the Visibility Graph. …”
    Conference Paper
  11. 11

    An Integrated RRT*SMART-A* Algorithm for solving the Global Path Planning Problem in a Static Environment by Suwoyo, Heru, Adriansyah, Andi, Andika, Julpri, Ubaidillah, Abu

    Published 2023
    “…The use of sampling-based algorithms such as Rapidly-Exploring Random Tree Star (RRT*) has been widely applied in robot path planning. …”
    Get full text
    Get full text
    Get full text
    Article
  12. 12

    AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT by SUWOYO, HERU, ADRIANSYAH, ANDI, ANDIKA, JULFRI, SHAMSUDIN, ABU UBAIDAH, ZAKARIA, MOHAMAD FAUZI

    Published 2023
    “…The use o = sampling-based algorithms such as Rapidly-Exploring Random Tree Star (RRT*) has been widely applied in robot path planning. …”
    Get full text
    Get full text
    Get full text
    Article
  13. 13

    AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT by Suwayo, Heri, Adrishah, Andi, Andika, Juleri, Shamdudin, Abu Ubaidah, Zakaria, Mohamad Fauzi

    Published 2023
    “…The use o = sampling-based algorithms such as Rapidly-Exploring Random Tree Star (RRT*) has been widely applied in robot path planning. …”
    Get full text
    Get full text
    Get full text
    Article
  14. 14

    AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT by SUWOYO, HERU, ADRIANSHAH, ANDI, ANDIKA, JULPRI, SHAMSUDIN, ABU UBAIDAH, ZAKARIA, MOHAMAD FAUZI

    Published 2023
    “…The use o = sampling-based algorithms such as Rapidly-Exploring Random Tree Star (RRT*) has been widely applied in robot path planning. …”
    Get full text
    Get full text
    Get full text
    Article
  15. 15
  16. 16
  17. 17
  18. 18

    AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT by SUWOYO, HERU, ADRIANSYAH, ANDI, JULI RI ANDIKA, JULI RI ANDIKA, SHAMSUDIN, ABU UBAIDAH, ZAKARIA, MOHAMAD FAUZI

    Published 2023
    “…The use o = sampling-based algorithms such as Rapidly-Exploring Random Tree Star (RRT*) has been widely applied in robot path planning. …”
    Get full text
    Get full text
    Get full text
    Article
  19. 19

    An Intelligent System Approach to the Dynamic Hybrid Robot Control by Md. Yeasin, Md. Mahmud Hasan

    Published 1996
    “…A one-pass smoothing algorithm was used to generate a practical smooth trajectory path in near real time. …”
    Get full text
    Get full text
    Thesis
  20. 20

    AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT by SUW, HERU, MI ATILTIANSYAH, AN, ANDIKA, JULI RI, SHAVISUDIN, UBAIDAH, AUZI ZAICARIX, M °H MAD

    Published 2023
    “…The use o = sampling-based algorithms such as Rapidly-Exploring Random Tree Star (RRT*) has been widely applied in robot path planning. …”
    Get full text
    Get full text
    Get full text
    Article