Search Results - (( using a ((path algorithm) OR (max algorithm)) ) OR ( java implication based algorithm ))

Search alternatives:

Refine Results
  1. 1
    A comparative performance analysis of computational intelligence techniques to solve the asymmetric travelling salesman problem

    A comparative performance analysis of computational intelligence techniques to solve the asymmetric travelling salesman problem by Odili, Julius Beneoluchi, Noraziah, Ahmad, Zarina, M.

    Published 2021
    “…The comparative algorithms in this study employ different techniques in their search for solutions to ATSP: the African Buffalo Optimization employs the modified Karp–Steele mechanism, Model-Induced Max-Min Ant Colony Optimization (MIMM-ACO) employs the path construction with patching technique, Cooperative Genetic Ant System uses natural selection and ordering; Randomized Insertion Algorithm uses the random insertion approach, and the Improved Extremal Optimization uses the grid search strategy. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  2. 2
    Improvement of Centralized Routing and Scheduling Using Cross-Layer Design and Multi-Slot Assignment in Wimax Mesh Networks

    Improvement of Centralized Routing and Scheduling Using Cross-Layer Design and Multi-Slot Assignment in Wimax Mesh Networks by Al-Humairi, Ali Zuhair Abdulameer

    Published 2009
    “…This thesis also proposes a centralized scheduling algorithm that can avoid the collision by constructing routing path with multi-slot single transceiver system for WiMAX mesh networks. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  3. 3
    Interference avoidance routing and scheduling using multiple transceivers for IEEE 802.16 mesh network

    Interference avoidance routing and scheduling using multiple transceivers for IEEE 802.16 mesh network by Qasem, Yaaqob Ali Ahmed

    Published 2010
    “…This algorithm looks for a short path from the subscriber station (SS) node to BS, while the optimal path is achieved when the whole path has the lowest EbMR. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  4. 4
    Development of low power viterbi decoder on complex programmable logic device platform

    Development of low power viterbi decoder on complex programmable logic device platform by Abu, Mohd Azlan

    Published 2018
    “…Consequently, the number of logic gates and the total power consumption of the STTC Viterbi decoder can be reduced by using the new algorithms. The proposed algorithms have been designed and implemented by using MATLAB, Altera Quartus 2 and Altera MAX V CPLD board. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    Fair and fit resource allocation algorithm for network-controlled device-to-device (D2D) communication / Yusmardiah Yusuf, Darmawaty Mohd. Ali and Roslina Mohamad

    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
    “…Therefore, such issues can be managed if radio resource is assigned intelligently with the coordination from the eNodeB (eNB). 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
    Save to List
    Saved in:
  6. 6
    Metaheuristic optimization techniques for localization in outdoor wireless sensor networks: a comprehensive review

    Metaheuristic optimization techniques for localization in outdoor wireless sensor networks: a comprehensive review by Gumaida, Bassam, Ibrahim, Adamu Abubakar

    Published 2025
    “…This paper serves as a comprehensive background on localization algorithms and methods used in wireless sensor networks, offering insights for researchers to develop efficient localization algorithms tailored to specific application requirements in diverse work environments.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  7. 7
    Dynamic transmit antenna shuffling scheme for hybrid multiple-input multiple-output in layered architecture

    Dynamic transmit antenna shuffling scheme for hybrid multiple-input multiple-output in layered architecture by Chong, Jin Hui

    Published 2010
    “…A fast QR decomposition detection algorithm, denoted as FAST-QR, is proposed for MLSF-OFDM. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  8. 8
    Cross layer design in 802.16d

    Cross layer design in 802.16d by Al-Hemyari, Ali, Qassem, Y. A., Ng, Chee Kyun, Noordin, Nor Kamariah, Ismail, Alyani, Khatun, Sabira

    Published 2009
    “…The construction of the routing path with multi-channel single transceiver system and single channel single transceiver is proposed together with centralized scheduling (CS) algorithms that reduce the existing interferences in WMN. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  9. 9
    Autonomous path planning through application of rotated two-parameter overrelaxation 9-point Laplacian iteration technique

    Autonomous path planning through application of rotated two-parameter overrelaxation 9-point Laplacian iteration technique by W. K. Ling, A. A. Dahalan, Azali Saudi

    Published 2020
    “…The harmonic functions are an appropriate method to be used on autonomous path planning because it satisfies the min-max principle, therefore avoiding the occurrence of local minima which traps robot’s movements, and that it offers complete path planning algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    Max-D clustering K-means algorithm for Autogeneration of Centroids and Distance of Data Points Cluster

    Max-D clustering K-means algorithm for Autogeneration of Centroids and Distance of Data Points Cluster by Wan Maseri, Wan Mohd, Beg, Abul Hashem, Tutut, Herawan, K., F.Rabbi

    “…MaxD k-means also used a novel strategy of setting the initial centroids. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  11. 11
    MaxD K-Means: A clustering algorithm for auto-generation of centroids and distance of data points in clusters

    MaxD K-Means: A clustering algorithm for auto-generation of centroids and distance of data points in clusters by Wan Maseri, Wan Mohd, Beg, Abul Hashem, Herawan, Tutut, Fazley Rabbi, Khandakar

    Published 2012
    “…MaxD K-means also used a novel strategy of setting the initial centroids. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    Batch mode heuristic approaches for efficient task scheduling in grid computing system

    Batch mode heuristic approaches for efficient task scheduling in grid computing system by Maipan-Uku, Jamilu Yahaya

    Published 2016
    “…We simulate our proposed algorithms using a Java based simulator that is purposedly built for Grid computing simulations. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    Max-average: an extended max-min scheduling algorithm for Grid computing environtment

    Max-average: an extended max-min scheduling algorithm for Grid computing environtment by Maipan-uku, J. Y., Muhammed, Abdullah, Abdullah, Azizol, Hussin, Masnida

    Published 2016
    “…This paper presents a new proposed grid based scheduling algorithm called Max-Average, inspired from Max-Min algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    Priority hybrid and EEF uplink scheduling algorithm for IEEE 802.16E

    Priority hybrid and EEF uplink scheduling algorithm for IEEE 802.16E by Oad, Aneel

    Published 2013
    “…In this research, two algorithms tailored at enhancing the performance of hybrid algorithms in the WiMAX domains have been designed and developed. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    A multidimensional data descriptor tool based on fuzzy min max neural network algorithm

    A multidimensional data descriptor tool based on fuzzy min max neural network algorithm by Fatin Nurjannah, Salauddin

    Published 2018
    “…The techniques is in the Neural Network which has a few popular techniques such as K-Nearest Neighbour Fuzzy Min Max, general Reflex Fuzzy Min Max to get some idea of methodologies, algorithm, techniques and concept of the whole existing project and research study. …”
    Get full text
    Get full text
    Get full text
    Undergraduates Project Papers
    Save to List
    Saved in:
  16. 16
    Fuzzy Logic Based Self-Adaptive Handover Algorithm for MobileWiMAX.

    Fuzzy Logic Based Self-Adaptive Handover Algorithm for MobileWiMAX. by Mohd Ali, Borhanuddin, Ismail, Alyani, Noordin, Nor Kamariah, Ben-Mubarak, Mohammed A., Ng , Ben Chee Kyun

    Published 2013
    “…The conventional handover decision algorithm in mobile WiMAX is based on a single criterion, which usually uses the received signal strength indicator (RSSI) as an indicator, with the other fixed handover parameters such as handover threshold and handover margin. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    Performance Analysis of Routing Protocols in Resource-Constrained Opportunistic Networks

    Performance Analysis of Routing Protocols in Resource-Constrained Opportunistic Networks by Aref Hassan, Kurd Ali, Halikul, Lenando, Mohamad, Alrfaay, Slim, Chaoui, Haithem Ben, Chikha, Akram, Ajouli

    Published 2019
    “…We firstly described these protocols and presented their algorithms. Thereafter, we carried out a comparative study of these protocols using exhaustive performance testing experiments with different numbers of nodes, traffic loads, message lifetime, and buffer size. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    Adaptive path finding algorithm in dynamic environment for warehouse robot

    Adaptive path finding algorithm in dynamic environment for warehouse robot by Ng, Mun Kit, Chong, Yung Wey, Ko, Kwang man, Park, Young Hoon, Leau, Yu Beng

    Published 2020
    “…For example, A* path finding algorithm is developed to obtain the shortest path, while D* obtains a complete coverage path from source to destination. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    Adaptive beamforming with 16 element linear array using MaxSIR and MMSE algorithms

    Adaptive beamforming with 16 element linear array using MaxSIR and MMSE algorithms by Islam, Md. Rafiqul, Hafriz, Fahmy, Norfauzi, Muhammad

    Published 2007
    “…Maximum Signal-to-Interference Ratio (MaxSIR) and Minimum Mean Square Error (MMSE) beamforming algorithms were investigated using 16 elements linear array antenna. …”
    Get full text
    Get full text
    Get full text
    Proceeding Paper
    Save to List
    Saved in:
  20. 20
    Analysis of Dijkstra’s and A* algorithm to find the shortest path

    Analysis of Dijkstra’s and A* algorithm to find the shortest path by Alija, Amani Saleh

    Published 2015
    “…There are so many algorithms used to find the shortest path such as Dijkstra, A* algorithm, Genetic algorithm, Floyd algorithm and Ant algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: