Search Results - intelligence agent ((tree algorithm) OR (graph algorithm))

  • Showing 1 - 10 results of 10
Refine Results
  1. 1

    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
  2. 2
  3. 3
  4. 4

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

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

    Knowledge-based system developement for the game congkak / Syah Ali Reza Yaacob by Yaacob, Syah Ali Reza

    Published 2006
    “…The agent will use Minimax and α-β pruning as the search algorithms. …”
    Get full text
    Get full text
    Thesis
  8. 8

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

    Published 1996
    “…Secondly, for the intelligent trajectory generation approach, the segmented tree neural networks for each link (inverse kinematics solution) and the randomness with fuzziness (coping the unstructured environment from the cost function) were used. …”
    Get full text
    Get full text
    Thesis
  9. 9
  10. 10