Search Results - data optimization ((((method algorithm) OR (path algorithm))) OR (max algorithm))

Refine Results
  1. 1

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

    Published 2025
    “…The primary objective of this paper isto review localization algorithms based on metaheuristic optimization techniques to improve localization accuracy. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  2. 2

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

    A generalized laser simulator algorithm for optimal path planning in constraints environment by Aisha, Muhammad

    Published 2022
    “…The results demonstrated that the proposed method could generate an optimal collision-free path. …”
    Get full text
    Thesis
  5. 5

    An Experiment of Ant Algorithms : Case Study of Kota Kinabalu Central Town by Nor Rafidah, Mohamad

    Published 2005
    “…There are many algorithms that used to solve this problem. In this study, ant algorithms are used to find the shortest path using a real data. …”
    Get full text
    Get full text
    Get full text
    Thesis
  6. 6

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

    High Rise Building Evacuation Route Model Using DIJKSTRA'S Algorithm by Mohd Sabri, Nor Amalina

    Published 2015
    “…As a result, the evacuation route model is able to gain the shortest path and safest path consistently between Dijkstra’s algorithms and hybrid version which is Dijkstra-Ant Colony Optimization (DACO). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  8. 8

    Reactive max-min ant system: An experimental analysis of the combination with K-OPT local searches by Sagban, Rafid, Ku-Mahamud, Ku Ruhana, Abu Bakar, Muhamad Shahbani

    Published 2015
    “…Ant colony optimization (ACO) is a stochastic search method for solving NP-hard problems. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  9. 9

    Design of radix-4 single path delay fast fourier transform processor with genetic algorithms optimization by Pang, Jia Hong

    Published 2011
    “…The genetic algorithms is proven to be a very effective method in optimization by using the way imitating natural process of living beings such as crossover, mutation and selection. …”
    Get full text
    Get full text
    Thesis
  10. 10
  11. 11

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

    Statistical data preprocessing methods in distance functions to enhance k-means clustering algorithm by Dalatu, Paul Inuwa

    Published 2018
    “…The K-Means algorithm is the commonest and fast technique in partitional cluster algorithms, although with unnormalized datasets it can achieve local optimal. …”
    Get full text
    Get full text
    Get full text
    Thesis
  13. 13
  14. 14
  15. 15
  16. 16
  17. 17
  18. 18
  19. 19
  20. 20