Search Results - (( _ application ((max algorithm) OR (path algorithm)) ) OR ( web location based algorithm ))

Refine Results
  1. 1

    Restaurant locator using Djikstra Algorithm / Mohamad Aliff Hakimi Lukman Hakim by Lukman Hakim, Mohamad Aliff Hakimi

    Published 2017
    “…Dijkstra’s algorithm is one of the classic shortest path search algorithms. …”
    Get full text
    Get full text
    Thesis
  2. 2

    Development of web-based GIS for traffic management system with obstacle avoidance technique using open source software by Nik Yusoff, Nik Mohd Ramli

    Published 2014
    “…Obstacle avoidance technique was implemented in this algorithm to avoid the congested areas. A web-based traffic management system was developed using open source software in this study. …”
    Get full text
    Get full text
    Thesis
  3. 3

    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
    “…This paper presents a comparative performance analysis of some metaheuristics such as the African Buffalo Optimization algorithm (ABO), Improved Extremal Optimization (IEO), Model-Induced Max-Min Ant Colony Optimization (MIMM-ACO), Max-Min Ant System (MMAS), Cooperative Genetic Ant System (CGAS), and the heuristic, Randomized Insertion Algorithm (RAI) to solve the asymmetric Travelling Salesman Problem (ATSP). …”
    Get full text
    Get full text
    Get full text
    Article
  4. 4
  5. 5

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

    Published 2010
    “…Here, a routing tree is constructed based on the energy/bit minimization routing (EbMR). 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
  6. 6
  7. 7

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

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

    Published 2010
    “…It is shown that the computational complexity of proposed FAST-QR detection algorithm is approximately 48 % lower than the conventional QR decomposition detection algorithm. …”
    Get full text
    Get full text
    Thesis
  9. 9
  10. 10

    A review of slicing techniques in software engineering by Shah, Asadullah, Raza, Ali, Hassan, Basri, Shah, Abdul Salam

    Published 2015
    “…This specific survey focuses on slicing techniques in the fields of numerous programing paradigms like web applications, object oriented, and components based. …”
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  11. 11
  12. 12
  13. 13

    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
    “…Among the challenging issues in mobile WiMAX handover are unnecessary handover, handover failure and handover delay, which may affect real-time applications. …”
    Get full text
    Get full text
    Article
  14. 14

    FRGS-13-081-0322/ design and modelling of novel dynamic bandwidth aggregation scheme in heterogeneous wireless network (hwn) for mission critical applications by Anwar, Farhat, Huda Adibah, Mohd

    Published 2018
    “…The amount of bandwidth has been calculated to transmit 600Kbps data over the three networks where 225Kbps, 141Kbps and 233.33Kbps have been transmitted through, WiFi, Cellular and WiMAX networks respectively. An algorithm has been proposed to measure the associated delay and reordering entropy caused due to packet reordering in HWN and it has been compared to the Earlies Delivery Path First (EDPF) method both for CBR and VBR applications on NS3 simulator. …”
    Get full text
    Get full text
    Monograph
  15. 15

    An event-driven simulation for highest urgency first (HUF) : a latency and modulation aware bandwidth allocation algorithm for WiMAX base stations. by Naghshbandi, Danial, Subramaniam, Shamala, Moghadam, Saeed Rahimi

    Published 2013
    “…To strike an ideal balance in gauging these trade-offs and to further complement the repository of simulators, this paper presents the details of a general-purpose programming language based discrete event simulation for WiMAX. This research has focused at developing a discrete-event simulator to implement bandwidth allocation algorithms for a WiMAX base station.The highest urgency first algorithm has been utilized as a benchmark deployment algorithm in order to provide: dynamic downlink/uplink adjustment and latency guarantee for real-time applications. …”
    Get full text
    Get full text
    Article
  16. 16

    OTS: an optimal tasks scheduling algorithm based on QoS in cloud computing network by Alhakimi, Mohammed Ameen, Latip, Rohaya

    Published 2019
    “…This study presents an optimal tasks scheduling algorithm by enhancing Max-Min algorithm. The simulation results have proven that the Proposed Optimal Tasks Scheduling OTS completes tasks execution with less execution time and higher performance compared with Max-Min and TS algorithms. …”
    Get full text
    Get full text
    Article
  17. 17

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

    Published 2016
    “…To address these problems, this research proposes three new distributed static batch mode inspired algorithms. The first (proposed) algorithm is based on Min-Min, called Min-Diff, the second algorithm is based on Max-Min, called Max-Average, and the third algorithm is to handle the load balancing, called Efficient Load Balancing (ELB). …”
    Get full text
    Get full text
    Get full text
    Thesis
  18. 18

    Max degree around (MDA) algorithm: a smart and efficient approximate algorithm for Vertex cover and independent set problems by Fayaz, Muhammad, Arshad, S, Shah, A.S, Shah, Asadullah

    Published 2016
    “…These problems motivated to propose Max Degres Around (MDA) approximation algorithm for the MVC problem. …”
    Get full text
    Get full text
    Get full text
    Article
  19. 19
  20. 20