Search Results - (( program implementation path algorithm ) OR ( parameter optimization max algorithm ))

Search alternatives:

Refine Results
  1. 1
    Simulation of shortest path using a-star algorithm / Nurul Hani Nortaja

    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
    Save to List
    Saved in:
  2. 2
    Vision-based robot indoor navigation

    Vision-based robot indoor navigation by Teo, Zhin Hang

    Published 2022
    “…A navigation robot is built to test the workability and efficiency of the algorithms. In general, the algorithm can provide the nearest path to navigate around the environment without manual assistance. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
    Save to List
    Saved in:
  3. 3
    Implementation of Autonomous Vehicle Navigation Algorithms Using Event-Driven Programming

    Implementation of Autonomous Vehicle Navigation Algorithms Using Event-Driven Programming by Saman, Abu Bakar Sayuti, Sebastian , Patrick, Malek, Nadhira, Hasidin, Nurul Zahidah

    Published 2012
    “…By using FSM to describe the behaviour of a navigating mobile robot, an equivalent algorithm can be developed. The algorithm can be relatively easy translated to a suitable program with event-driven programming technique. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  4. 4
    Reactive approach for automating exploration and exploitation in ant colony optimization

    Reactive approach for automating exploration and exploitation in ant colony optimization by Allwawi, Rafid Sagban Abbood

    Published 2016
    “…Ant colony optimization (ACO) algorithms can be used to solve nondeterministic polynomial hard problems. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    Optimization Of Two-Dimensional Dual Beam Scanning System Using Genetic Algorithms

    Optimization Of Two-Dimensional Dual Beam Scanning System Using Genetic Algorithms by Koh, Johnny Siaw Paw

    Published 2008
    “…This algorithm has been tested and implemented successfully via a dual beam optical scanning system.…”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  6. 6
    Implementation of an autonomous mobile robot navigation algorithm using C language

    Implementation of an autonomous mobile robot navigation algorithm using C language by Subra Mullisi, Shafeq Marwan

    Published 2009
    “…The problem can basically be divided into positioning and path planning. This report basically discusses the study and also work that has been done from previous of the chosen topic, which is Implementation of an Autonomous Mobile Robot Navigation Algorithm using 'C' language. …”
    Get full text
    Get full text
    Final Year Project
    Save to List
    Saved in:
  7. 7
    Ant colony optimization in dynamic environments

    Ant colony optimization in dynamic environments by Chen, Fei Huang

    Published 2010
    “…The last objective of this thesis is to optimize the parameter settings of the best performing ant algorithm with local search. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  8. 8
    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 proposes an optimized strategy namely cross-layer design in routing algorithms used find the best route for all SSs and scheduling algorithms, used to assign a time slot for each possible node transmission. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    Implementation of autonomous vehicle navigation algorithms using event-driven programming

    Implementation of autonomous vehicle navigation algorithms using event-driven programming by Saman, Abu Bakar Sayuti, Sebastian , Patrick, Malek, Nadhira, Hasidin, Nurul Zahidah

    Published 2012
    “…By using FSM to describe the behaviour of a navigating mobile robot, an equivalent algorithm can be developed. The algorithm can be relatively easy translated to a suitable program with event-driven programming technique. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  10. 10
    Prediction and multi-criteria-based schemes for seamless handover mechanism in mobile WiMAX networks

    Prediction and multi-criteria-based schemes for seamless handover mechanism in mobile WiMAX networks by Mubarak, Mohammed Awadh Ahmed Ben

    Published 2013
    “…It reduces the number of handovers by 29.7% and 26.9%, respectively, compared to the conventional RSSI based handover algorithm and the previous worked, mobility improved handover (MIHO) algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    GPS boundary navigation of DrosoBots using MATLAB simulation

    GPS boundary navigation of DrosoBots using MATLAB simulation by Zainal Abidin, Zulkifli, Ngah , Vmi Kalthum, Arshad, Mohd Rizal, Kok , Chee Hou

    Published 2010
    “…To implement this, region recognition and several path planning algorithms have been utilized. …”
    Get full text
    Get full text
    Proceeding Paper
    Save to List
    Saved in:
  12. 12
    An improved algorithm in test case generation from UML activity diagram using activity path

    An improved algorithm in test case generation from UML activity diagram using activity path by Hashim, Nor Laily, Salman, Yasir D.

    Published 2011
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  13. 13
    Railway shortest path planner application using ant colony optimization algorithm / Muhammad Hassan Firdaus Ruslan

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

    Published 2017
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  14. 14
    Electric vehicle battery state of charge estimation using metaheuristic-optimized CatBoost algorithms

    Electric vehicle battery state of charge estimation using metaheuristic-optimized CatBoost algorithms by Mohd Herwan, Sulaiman, Zuriani, Mustaffa, Ahmad Salihin, Samsudin, Amir Izzani, Mohamed, Mohd Mawardi, Saari

    Published 2025
    “…A comprehensive data preprocessing pipeline was implemented, including missing value treatment, outlier removal, and feature normalization using Min-Max scaling. Three distinct metaheuristic algorithms were investigated: Barnacles Mating Optimizer (BMO), Particle Swarm Optimization (PSO), Genetic Algorithm (GA), and Whale Optimization Algorithm (WOA), each integrated with CatBoost to optimize critical parameters including learning rate, tree depth, regularization, and bagging temperature. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  15. 15
    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization

    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

    Published 2019
    “…BST inserts the nodes in the way that the Dijkstra’s can find the empty parking in fastest way. Dijkstra’s algorithm initials the paths to finding the shortest path while ACO optimizes the paths. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    Development of obstacle avoidance technique in web-based geographic information system for traffic management using open source software

    Development of obstacle avoidance technique in web-based geographic information system for traffic management using open source software by Nik Yusoff, Nik Mohd Ramli, Mohd Shafri, Helmi Zulhaidi, Muniandy, Ratnasamy, Mohammad Wali, Islam

    Published 2014
    “…Pg Routing as an extension of Postgre SQL/Post GIS database is an open source library that implements the Dijkstra shortest path algorithm. However, the functionality to avoid obstacles in that analysis is still limited. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    Single Fitness Function to Optimize Energy using Genetic Algorithms for Wireless Sensor Network

    Single Fitness Function to Optimize Energy using Genetic Algorithms for Wireless Sensor Network by Ismail Abdullah, Kalid Abdlkader Marsal

    Published 2024
    journal::journal article
    Save to List
    Saved in:
  18. 18
    Development of Path Loss Models for Smooth and Convex Surfaces Terrains in Malaysian Environment

    Development of Path Loss Models for Smooth and Convex Surfaces Terrains in Malaysian Environment by Wong, Peng Kiong

    Published 2004
    “…This program consists of four algorithms which are conversion formulas, smooth terrain, single convex surface terrain and double convex surfaces terrain.…”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  19. 19
    Parallel genetic algorithms for shortest path routing in high- performance computing / Mohd Erman Safawie Che Ibrahim

    Parallel genetic algorithms for shortest path routing in high- performance computing / Mohd Erman Safawie Che Ibrahim by Che Ibrahim, Mohd Erman Safawie

    Published 2012
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    An Enhanced Simulated Annealing Routing Algorithm for Semi-Diagonal Torus Network

    An Enhanced Simulated Annealing Routing Algorithm for Semi-Diagonal Torus Network by Noraziah, Adzhar, Shaharuddin, Salleh

    Published 2017
    “…While this algorithm guarantees to find the shortest path for each single net, if it exists, each routed net will form obstacle for later paths. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: