Search Results - (( develop using ((path algorithm) OR (max algorithm)) ) OR ( java implication based 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

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

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

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

    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 WIMAX mesh network (WMN) is developed with the use of base station (BS) as the main controller. …”
    Get full text
    Get full text
    Get full text
    Article
  6. 6

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

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

    The Development Of A Robust Algorithm For Uav Path Planning In 3d Environment by Kok, Kai Yit

    Published 2016
    “…Significant research has been conducted on Unmanned Aerial Vehicle (UAV) path planning using evolutionary algorithms, such as Particle Swarm Optimization (PSO), Genetic Algorithm (GA), Differential Evolution (DE), and Biogeographic-Based Optimization (BBO). …”
    Get full text
    Get full text
    Thesis
  9. 9

    Simulation of shortest path using a-star algorithm / Nurul Hani Nortaja by Nurul Hani , Nortaja

    Published 2004
    “…The steps to calculate a shortest path using A • algorithm is shown by using appropriate examples and related figures. …”
    Get full text
    Get full text
    Thesis
  10. 10

    Path planning for unmanned aerial vehicles using visibility line-based methods by Omar, Rosli

    Published 2011
    “…In addition, a software package using Matlab for 2D and 3D path planning has also been developed. …”
    Get full text
    Get full text
    Thesis
  11. 11

    Nlfxlms and thf-nlfxlms algorithms for wiener-hammerstein nonlinear active noise control by Srazhidinov, Radik

    Published 2016
    “…However, this assumption may lead to inaccurate secondary path model. In this work, the modelling of acoustic path using FIR filters is incorporated for both algorithms for Wiener-Hammerstein structure. …”
    Get full text
    Get full text
    Thesis
  12. 12

    The application of neural networks and min-max algorithm in digital congkak by Che Pa, Noraziah, Alwi, Asmidah, Mohamed Din, Aniza, Safwan, Muhammad

    Published 2013
    “…To make it intelligent, its player agent was developed using a combination of Neural Networks and Min-Max algorithm. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  13. 13

    Automated path testing using the negative selection algorithm by Shayma Mustafa Mohi-Aldeen, Radziah Mohamad, Safaai Deris

    Published 2017
    “…Negative selection algorithm (NSA) has been used in this paper to generate test data for path testing automatically. …”
    Get full text
    Get full text
    Indexed Article
  14. 14

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

    Published 2015
    “…The objective is to design and develop an evacuation route using shortest path algorithm based on the evacuation map of the building. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  15. 15

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

    Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer by Ahmad Nezer, Nurul Aqilah

    Published 2017
    “…The methodology that used for developing this system is the Dijkstra’s algorithm. …”
    Get full text
    Get full text
    Thesis
  17. 17

    Simulation of identifying shortest path walkway in library by using ant colony optimization by Chui Teng, Chan

    Published 2012
    “…The system is used to be error free and the algorithm can effectively solve the shortest path problem.…”
    Get full text
    Get full text
    Undergraduates Project Papers
  18. 18

    Comparison of path planning in simulated robot by Ch’ng, Chee Yu’ng

    Published 2020
    “…There are 4 path planning algorithms will be compared, which are Dijkstra’s algorithm, A* algorithm, RapidExploring Random Tree (RRT) algorithm, and the last one is an algorithm modified from A*. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  19. 19

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

    Published 2022
    “…This research focuses on developing a novel path planning algorithm, called Generalized Laser Simulator (GLS), to solve the path planning problem of mobile robots in a constrained environment. …”
    Get full text
    Thesis
  20. 20

    A new minimum pheromone threshold strategy (MPTS) for max-min ant system by Wong, Kuan Yew, See, Phen Chiak

    Published 2009
    “…Thereafter, various suggestions have been made to improve the performance of the ACO algorithm. One of them is through the development of the max–min ant system (MMAS) algorithm. …”
    Get full text
    Get full text
    Article