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

Refine Results
  1. 1

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

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

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

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

    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
    “…The exploration versus exploitation dilemma rises in ACO search.Reactive max-min ant system algorithm is a recent proposition to automate the exploration and exploitation.It memorizes the search regions in terms of reactive heuristics to be harnessed after restart, which is to avoid the arbitrary exploration later.This paper examined the assumption that local heuristics are useless when combined with local search especially when it applied for combinatorial optimization problems with rugged fitness landscape.Results showed that coupling reactive heuristics with k-Opt local search algorithms produces higher quality solutions and more robust search than max-min ant system algorithm.Well-known combinatorial optimization problems are used in experiments, i.e. traveling salesman and quadratic assignment problems. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  8. 8

    An improvement of stochastic gradient descent approach for mean-variance portfolio optimization problem by S. W. Su, Stephanie, Kek, Sie Long

    Published 2021
    “…Furthermore, the applicability of SGD, Adam, AdaMax, Nadam, AMSGrad, and AdamSE algorithms in solving the mean-variance portfolio optimization problem is validated.…”
    Get full text
    Get full text
    Get full text
    Article
  9. 9

    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. Moreover, the proposed algorithm result are compared to some common algorithms such as the A* algorithm, Probabilistic Road Map, RRT, Bi-directional RRT, and Laser Simulator algorithm to demonstrate its effectiveness. …”
    Get full text
    Thesis
  10. 10

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

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

    Maximum 2-satisfiability in radial basis function neural network by Shehab Abdulhabib Alzaeemi, Saratha Sathasivam, Mohd Shareduwan Mohd Kasihmuddin, Mohd. Asyraf Mansor

    Published 2020
    “…In this study, the effectiveness of RBFNN-MAX2SAT can be estimated by evaluating the proposed models with testing data sets. …”
    Get full text
    Get full text
    Get full text
    Article
  13. 13

    Railway shortest path planner application using ant colony optimization algorithm / Muhammad Hassan Firdaus Ruslan by Ruslan, Muhammad Hassan Firdaus

    Published 2017
    “…For the process module, Ant Colony Optimization (ACO) algorithm was used to find the shortest path. …”
    Get full text
    Get full text
    Thesis
  14. 14
  15. 15

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

    Published 2011
    “…This research work involves the implementation of Single Objective Genetic Algorithm (SOGA) and Multi-objectives Genetic Algorithm (MOGA) in a 16-point Radix-4 Single Path Delay Feedback (R4SDF) pipelined Fast Fourier Transform (FFT) processor. …”
    Get full text
    Get full text
    Thesis
  16. 16
  17. 17
  18. 18
  19. 19
  20. 20