Search Results - (( java implication based algorithm ) OR ( problem presentation connection algorithm ))

Refine Results
  1. 1

    Routing problem in rectangular mesh network using Dijkstra’s based Greedy method by Noraziah, Adzhar, Shaharuddin, Salleh, Yuhani, Yusof, Muhammad Azrin, Ahmad

    Published 2018
    “…Therefore, developing a shortest path based routing algorithm is in need. In this research, Dijkstra’s algorithm is used to establish the shortest connection for each net. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  2. 2

    Routing problem in rectangular mesh network using shortest path based Greedy method by Noraziah, Adzhar, Shaharuddin, Salleh, Yuhani, Yusof, Muhammad Azrin, Ahmad

    Published 2019
    “…Therefore, developing a shortest path based routing algorithm is in need. In this research, Dijkstra's algorithm is used to establish the shortest connection for each net. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  3. 3

    Routing problem in rectangular mesh network using shortest path based Greedy method by Noraziah, Adzhar, Shaharuddin, Salleh, Yuhani, Yusof, Muhammad Azrin, Ahmad

    Published 2019
    “…Therefore, developing a shortest path based routing algorithm is in need. In this research, Dijkstra's algorithm is used to establish the shortest connection for each net. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  4. 4

    Profit-based optimal generation scheduling of a microgrid by Muhamad Razali N.M., Hashim A.H.

    Published 2023
    “…A case study on the difference between grid-connected and islanded operation is presented. The results demonstrate the efficiency of using genetic algorithm to solve the optimization problem. �2010 IEEE.…”
    Conference paper
  5. 5

    An Enhanced Simulated Annealing Routing Algorithm for Semi-Diagonal Torus Network by Noraziah, Adzhar, Shaharuddin, Salleh

    Published 2017
    “…In this paper, we present a routing algorithm based on enhanced simulated annealing technique to provide the connection between nodes in a semi-diagonal torus (SD-Torus) network. …”
    Get full text
    Get full text
    Get full text
    Article
  6. 6

    Quantum Processing Framework And Hybrid Algorithms For Routing Problems by Soltan Aghaei, Mohammad Reza

    Published 2010
    “…Moreover, a quantum algorithm was designed to solve the shortest paths problem between the two points in a network. …”
    Get full text
    Get full text
    Thesis
  7. 7
  8. 8

    Hybrid Harris Hawks with Sine Cosine for Optimal Node Placement and Congestion Reduction in an Industrial Wireless Mesh Network by Abdulrab, H.Q.A., Hussin, F.A., Ismail, I., Assaad, M., Awang, A., Shutari, H., Devan, P.A.M.

    Published 2023
    “…Consequently, a novel hybrid Harris Hawks optimization with the sine cosine algorithm (HHOSCA) is presented in this work to tackle the aforementioned WMN optimization problems. …”
    Get full text
    Get full text
    Article
  9. 9

    Density based subspace clustering: a case study on perception of the required skill by Rahmat Widia, Sembiring

    Published 2014
    “…In the early stage, the present research estimates density dimensions and the results are used as input data to determine the initial cluster based on density connection, using DBSCAN algorithm. …”
    Get full text
    Get full text
    Thesis
  10. 10

    Density subspace clustering: a case study on perception of the required skill by Sembiring, Rahmat Widia

    Published 2014
    “…In the early stage, the present research estimates density dimensions and the results are used as input data to determine the initial cluster based on density connection, using DBSCAN algorithm. …”
    Get full text
    Get full text
    Thesis
  11. 11
  12. 12

    Scheduling algorithm for multiuser diversity in urban area / Hamizah Mohd Mahayudin by Mohd Mahayudin, Hamizah

    Published 2015
    “…Hence, analysis of the wireless connection attribute such as fairness, throughput and delay occur during users demanding for different services are presented. …”
    Get full text
    Get full text
    Thesis
  13. 13
  14. 14

    Joint optimization of resources allocation for quality of service aware next-generation heterogeneous cellular networks / Hayder Faeq Rasool Alhashimi by Hayder Faeq Rasool , Alhashimi

    Published 2025
    “…Then, an auction algorithm is proposed to solve the channel assignment optimization problem to maximize the spectrum efficiency (SE). …”
    Get full text
    Get full text
    Get full text
    Thesis
  15. 15
  16. 16

    Neighbour-based on-demand routing algorithms for mobile ad hoc networks by Ejmaa, Ali Mohamed E.

    Published 2017
    “…Furthermore, the third algorithm NDAR presents further enhancement and better performance in all five performance metrics as compared to NCPR and AODV algorithms in a low or high density of nodes. …”
    Get full text
    Get full text
    Get full text
    Thesis
  17. 17

    LOCALIZED MOVEMENT CONTROL CONNECTIVITY RESTORATION ALGORITHMS FOR WIRELESS SENSOR AND ACTOR NETWORKS by MUHAMMAD IMRAN, MUHAMMAD IMRAN

    Published 2011
    “…In this dissertation, we address the challenging connectivity restoration problem while maintaining minimal network state information. …”
    Get full text
    Get full text
    Thesis
  18. 18
  19. 19
  20. 20

    Numerical experiment on conformal mapping of doubly connected regions onto a disk with a slit by Murid, Ali H. M., Laey, Nee Hu

    Published 2009
    “…We present a method for computing the conformal mapping function of doubly connected regions bounded by two closed Jordan curves onto a disk with a concentric circular slit of radius . …”
    Get full text
    Article