Search Results - (( develop work ((graph algorithm) OR (path algorithm)) ) OR ( java implication based algorithm ))

Search alternatives:

Refine Results
  1. 1
    Graph processing hardware accelerator for shortest path algorithms in nanometer very large-scale integration interconnect routing

    Graph processing hardware accelerator for shortest path algorithms in nanometer very large-scale integration interconnect routing by Ch'ng, Heng Sun

    Published 2007
    “…Graphs are pervasive data structures in computer science, and algorithms working with them are fundamental to the field. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  2. 2
    Laser simulator: a novel search graph-based path planning approach

    Laser simulator: a novel search graph-based path planning approach by Ali, Mohammed A. H., Musa, Mailah

    Published 2018
    “…A novel technique called laser simulator approach for visibility search graph-based path planning has been developed in this article to determine the optimum collision-free path in unknown environment. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  3. 3
    Implementation of laser simulator in robot path determination

    Implementation of laser simulator in robot path determination by Zenas, Chung Han Yuan

    Published 2016
    “…From this research, the laser simulator has advantages in computational time and low collision possibility compare with A* algorithm while the path cost of laser simulator is always greater than path cost of A* algorithm.…”
    Get full text
    Get full text
    Undergraduates Project Papers
    Save to List
    Saved in:
  4. 4
    Optimization of mobile robot path planning in semi-dynamic environment using genetic algorithm

    Optimization of mobile robot path planning in semi-dynamic environment using genetic algorithm by Kasim Hawari, Mohd Zarifitri

    Published 2023
    “…Thus, this thesis aims to develop a mobile robot for industrial applications by leveraging a genetic algorithm (GA). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    Design of DNA fragment assembly using IWP method on application-specific integrated-circuit / Hasniliati Hassan

    Design of DNA fragment assembly using IWP method on application-specific integrated-circuit / Hasniliati Hassan by Hassan, Hasniliati

    Published 2017
    “…After reviewing various algorithms, it was decided to apply de Bruijn graphs and Eulerian circuits that are based on graph theory. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  6. 6
    Nlfxlms and thf-nlfxlms algorithms for wiener-hammerstein nonlinear active noise control

    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
    Save to List
    Saved in:
  7. 7
    Simulation of identifying shortest path walkway in library by using ant colony optimization

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

    Published 2012
    “…Therefore,by determining the shortest path will help in reducing the time consume problem.This project is developed by starting with designing the workflow diagram as well as the design of the output interface.The work flow is the guide for the process of development.In between,Heuristic Approach is used to determine the entire possible paths at first,then Ant Colony Optimization algorithm will be implemented to search for the final and the shortest path. …”
    Get full text
    Get full text
    Undergraduates Project Papers
    Save to List
    Saved in:
  8. 8
    An improved algorithm for channel allocation on direct sequence spread spectrum

    An improved algorithm for channel allocation on direct sequence spread spectrum by Handrizal, M

    Published 2011
    “…Meanwhile between the VMA and Dsatur algorithm in the complex graph is equivalent to 18.1%.However,VMA and Welsh Powell algorithm is not compared in the complex graph since its drawback in terms of not fulfill the graph coloring concept.This is because there are two adjacent vertices have the same color.Overall, even there is no reduction for number of required channel among VMA,Dsatur algorithm and Welsh Powell algorithm in the simple graph,but the outstanding significant contribution of VMA since it has reduction in the complex graph.…”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    Adaptive path finding algorithm in dynamic environment for warehouse robot

    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
    “…This paper presents AD* algorithm, a path finding algorithm that works in dynamic environment for warehouse robot. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    A generalized laser simulator algorithm for optimal path planning in constraints environment

    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
    Save to List
    Saved in:
  11. 11
    Novel algorithm for mobile robot path planning in constrained environment

    Novel algorithm for mobile robot path planning in constrained environment by Muhammad, Aisha, Ali, Mohammed A. H., Turaev, Sherzod, Shanono, Ibrahim Haruna, Hujainah, Fadhl, Mohd Zubir, Mohd Nashrul, Faiz, Muhammad Khairi, Mohd Faizal, Erma Rahayu, Abdulghafor, Rawad Abdulkhaleq Abdulmolla

    Published 2021
    “…This paper presents a development of a novel path planning algorithm, called Generalized Laser simulator (GLS), for solving the mobile robot path planning problem in a two-dimensional map with the presence of constraints. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    Wide area measurement system in the IEEE-14 bus system using multiobjective shortest path algorithm for fault analysis

    Wide area measurement system in the IEEE-14 bus system using multiobjective shortest path algorithm for fault analysis by Awalin, Lilik J., Syahirah, Abd Halim, Jafferi, Jamaludin, Nor Azuana, Ramli

    Published 2021
    “…The IEEE-14 bus system was modeled in PSCAD software for simulating nineteen types of fault based on multi-objective shortest path algorithm. To manage the wide area measurement, the research must comprehend the working principle of the multi-objective shortest path algorithm, whereby the proposed method will determine the new path for the IEEE-14 bus system. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  13. 13
    Keyword query processing interface model of ontological natural language manipulation

    Keyword query processing interface model of ontological natural language manipulation by Hasany, Syed Muhammad Noman

    Published 2010
    “…We used the shortest path algorithms to be called on certain resources to explore connectivity to reduce complexity of search. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  14. 14
    Comparison of path planning in simulated robot

    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
    Save to List
    Saved in:
  15. 15
    Novel algorithm for mobile robot path planning in constrained environment

    Novel algorithm for mobile robot path planning in constrained environment by Aisha, Muhammad, Ali, Mohammed A. H., Turaev, Sherzod, Shanono, Ibrahim Haruna, Hujainah, Fadhl, Mohd Nashrul, Mohd Zubir, Muhammad Khairi Faiz, ., Erma Rahayu, Mohd Faizal, Abdulghafor, Rawad

    Published 2022
    “…This paper presents a development of a novel path planning algorithm, called Generalized Laser simulator (GLS), for solving the mobile robot path planning problem in a two-dimensional map with the presence of constraints. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    Novel algorithm for mobile robot path planning in constrained environment

    Novel algorithm for mobile robot path planning in constrained environment by Muhammad, Aisha, Ali, Mohammed A. H., Turaev, Sherzod, Shanono, Ibrahim Haruna, Hujainah, Fadhl, Mohd Nashrul, Mohd Zubir, Muhammad Khairi, Faiz, Erma Rahayu, Mohd Faizal, Abdulghafor, Rawad

    Published 2022
    “…This paper presents a development of a novel path planning algorithm, called Generalized Laser simulator (GLS), for solving the mobile robot path planning problem in a two-dimensional map with the presence of constraints. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    Meta-Heuristic Algorithms for Learning Path Recommender at MOOC

    Meta-Heuristic Algorithms for Learning Path Recommender at MOOC by Son, N.T., Jaafar, J., Aziz, I.A., Anh, B.N.

    Published 2021
    “…We have developed Metaheuristic algorithms includes the Genetic Algorithm (GA) and Ant Colony Optimization Algorithm (ACO), to solve the proposed model. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    Develpoment of combinatorial optimisation for cutting tool path strategy

    Develpoment of combinatorial optimisation for cutting tool path strategy by Alsultaney, Hazem K., Mohd Ariffin, Mohd Khairol Anuar, Baharudin, B. T. Hang Tuah, Ali, Aidy, Mustapha, Faizal

    Published 2009
    “…This work aims to optimise the tool path by simulating the removal of material in a finite element environment, which is controlled by a Genetic Algorithm. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  19. 19
    VISUALIZATION OF GENETIC ALGORITHM BASED ON 2-D GRAPH TO ACCELERATE THE SEARCHING WITH HUMAN INTERVENTIONS.

    VISUALIZATION OF GENETIC ALGORITHM BASED ON 2-D GRAPH TO ACCELERATE THE SEARCHING WITH HUMAN INTERVENTIONS. by FAROOQ, HUMERA

    Published 2012
    “…A tool termed as VIGA-20 (Visualization of Genetic Algorithm using 2-0 Graph) is implemented to accomplish this goal. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    Simulation of identifying shortest path walkway using particle swarm optimization (PSO)

    Simulation of identifying shortest path walkway using particle swarm optimization (PSO) by Kae Shin, Yong

    Published 2012
    “…Therefore, this project is develop to find the shortest path which means to find a path with minimum distance between two locations by apply the algorithm of Particle Swarm Optimization technique.This system is expected to solve the shortest path and identify the optimal path.Due to this,it is tend to reduce the time consume in specific situation with the determining of shortest path. …”
    Get full text
    Get full text
    Undergraduates Project Papers
    Save to List
    Saved in:

Search Tools: