Search Results - (( java implementation path algorithm ) OR ( using cell sizing algorithm ))

Search alternatives:

Refine Results
  1. 1
    Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer

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

    Published 2017
    “…The development tools used in developing this project is NetBeans by using Java for the implementation of the coding. The methodology that used for developing this system is the Dijkstra’s algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  2. 2
    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:
  3. 3
    Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment

    Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment by Shaliza Hayati A. Wahab, Nordin Saad, Azali Saudi, Ali Chekima

    Published 2021
    “…In this study, a fast iterative method known as Rotated Successive Over-Relaxation (RSOR) is introduced. The algorithm is implemented in a self-developed 2D Java tool, UAV Planner. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  4. 4
    Smart appointment organizer for mobile application / Mohd Syafiq Adam

    Smart appointment organizer for mobile application / Mohd Syafiq Adam by Adam, Mohd Syafiq

    Published 2009
    “…The main component of this prototype is the use of Dijkstra algorithm to compute the shortest path from source of appointment to the 6 points of destinations within UiTM Shah Alam. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    A study on the VLSI partitions: the implementation of Fiduccia-Mattheyses algorithm / Burhanuddin Omar

    A study on the VLSI partitions: the implementation of Fiduccia-Mattheyses algorithm / Burhanuddin Omar by Omar, Burhanuddin

    Published 1997
    “…To deal with cells of various size , the algorithm progresses by moving one cell at a time between the blocks of the partition while maintaining a desired based on the size of the blocks rather than the number of cells per block. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  6. 6
    Indoor global path planning based on critical cells using dijkstra algorithm

    Indoor global path planning based on critical cells using dijkstra algorithm by Azrul Amri, Jamal, Engku Fadzli Hasan, Syed Abdullah, Fatma Susilawati, Mohamad

    Published 2015
    “…This paper proposes global path planning based on grids representation in an indoor environment using Dijkstra algorithm. The algorithm uses floor plan of any environment discretized to some equal-sized square grids. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  7. 7
    Detection of acute leukaemia cells using variety of features and neural networks

    Detection of acute leukaemia cells using variety of features and neural networks by A. S., Abdul Nasir, Mohd Yusoff, Mashor, Prof. Dr., H., Rosline

    Published 2011
    Get full text
    Working Paper
    Save to List
    Saved in:
  8. 8
    Enhanced cell-based algorithm with dynamic radius in solving capacitated multi-source weber problem

    Enhanced cell-based algorithm with dynamic radius in solving capacitated multi-source weber problem by Nurhazwani, Ahmad Razak

    Published 2021
    “…This research finds the location of facilities in a continuous space to meet the demand of customers which minimize the total cost using Enhanced Cell-based Algorithm (ECBA). This method was derived from previous study that divides the distribution of customers into smaller cells of promising locations. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    Synthesis of transistor-chaining algorithm for CMOS cell layout using bipartite graph / Azizi Misnan

    Synthesis of transistor-chaining algorithm for CMOS cell layout using bipartite graph / Azizi Misnan by Misnan, Azizi

    Published 1997
    “…The algorithm will be implemented and tested in this project using C language. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    Path planning algorithm for a car-like robot based on cell decomposition method

    Path planning algorithm for a car-like robot based on cell decomposition method by Omar, Nurhanum

    Published 2013
    “…Using cell decomposition, the free space of the robot is exactly partitioned into cells. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    A genetic algorithm approach to VLSI macro cell non-slicing floorplans using binary tree

    A genetic algorithm approach to VLSI macro cell non-slicing floorplans using binary tree by Rahim At Samsuddin, H. A., Ab. Rahman, A. A. H., Andaljayalakshmi, G., Ahmad, R. B.

    Published 2008
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  12. 12
    Improved combined mutation clonal selection algorithm

    Improved combined mutation clonal selection algorithm by Paw J.K.S., Hen C.K., Yan K.W., Ann Y.S.

    Published 2023
    “…In this paper, the performance of a clonal selection optimization algorithm implementing a combined mutation strategy using Gaussian and Cauchy mutations was further improved with the addition of two new operators, namely the Cell Repair Operator (CPO) and Dynamic Mutation Size Operator (DMSO). …”
    Conference paper
    Save to List
    Saved in:
  13. 13
    The impact of population size on knowledge acquisition in genetic algorithms paradigm: Finding solutions in the game of Sudoku

    The impact of population size on knowledge acquisition in genetic algorithms paradigm: Finding solutions in the game of Sudoku by Abu Bakar, Nordin, Mahadzir, Muhammad Fadhil

    Published 2010
    “…Population size is an important component in genetic algorithms (GAs).The concept of population in GAs has contributed to a unique searching strategy which empower its search process through the massive volume of the data in a population.The purpose of this study is to see how the impact of population size on genetic algorithms in producing correct solution for a Sudoku puzzle.Sudoku is a Japanese number puzzle game that has become a worldwide phenomenon.The puzzle involves completing a grid of cells by assigning a single number to each cell.The numbers in a row or a column must consist of any one of the numbers from 1 to 9; no repetition is allowed.GA will be used to generate the correct solution of Sudoku puzzles.The mechanism to produce legal Sudoku grid will follow the requirements needed and meet all the constraints.A fitness function is designed to evaluate legal grids and GA will be tested for performance and time efficiency.The challenges lie on how GA will represent a Sudoku grid in the process and the effectiveness of its operators such as crossover and mutation.The results show how different population size can produce different solutions.The best performance is observed at 500 population size.The paper will conclude with an insight of this value and its significance to the knowledge acquisition in GA paradigm..…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  14. 14
    An integrated priority-based cell attenuation model for dynamic cell sizing

    An integrated priority-based cell attenuation model for dynamic cell sizing by Amphawan, Angela, Omar, Mohd Nizam, Din, Roshidi

    Published 2012
    “…Real-time predicted mobile traffic from the EFuNN structure was used to control the size of all the cells.Results obtained demonstrate the robustness of the integrated module in recognizing the temporal pattern of the mobile traffic and dynamically controlling the cell size in order to reduce the number of calls dropped.…”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  15. 15
    A genetic algorithm approach to VLSI macro cell non-slicing floorplans using binary tree

    A genetic algorithm approach to VLSI macro cell non-slicing floorplans using binary tree by Hasliza, A. Rahim@Samsuddin, Ab Al-Hadi, Ab Rahman, Andaljayalakshmi, G., R. Badlishah, Ahmad, Wan Nur Suryani Firuz, Wan Arrifin

    Published 2009
    Get full text
    Working Paper
    Save to List
    Saved in:
  16. 16
    Genetic algorithms for VLSI micro-Cell layout area optimization based on binary tree

    Genetic algorithms for VLSI micro-Cell layout area optimization based on binary tree by Hasliza, A. Rahim@Samsuddin, Ab Al-Hadi, Ab Rahman, R. Badlishah, Ahmad, 'Aini Syuhada, Md Zain, M.I., Ahmad, Wan Nur Suryani Firuz, Wan Arrifin

    Published 2009
    Get full text
    Working Paper
    Save to List
    Saved in:
  17. 17
    A genetic algorithm approach to VLSI macro cell non-slicing floorplans using binary tree

    A genetic algorithm approach to VLSI macro cell non-slicing floorplans using binary tree by Hasliza, A. Rahim@Samsuddin, Ab Rahman, A. A H, Andaljayalakshmi, G., R. Badlishah, Ahmad, Wan Nur Suryani Firuz, Wan Ariffin

    Published 2009
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    Optimal path planning algorithms in virtual environments

    Optimal path planning algorithms in virtual environments by Hassan, Rohayanti

    Published 2006
    “…It was also found that the combination of A* algorithm and Cell Mapping technique can be applied to a wide range of VE’s sizes.…”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  19. 19
    Synthesis of transistor chaining algorithm for CMOS cell layout using bipartite graph / Azizi Misnan

    Synthesis of transistor chaining algorithm for CMOS cell layout using bipartite graph / Azizi Misnan by Misnan, Azizi

    Published 1997
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    Diagnosis of eyesight using Improved Clonal Selection Algorithm (ICLONALG) / Nor Khirda Masri

    Diagnosis of eyesight using Improved Clonal Selection Algorithm (ICLONALG) / Nor Khirda Masri by Masri, Nor Khirda

    Published 2017
    “…This study aims to implement the classification algorithm using the Improved Clonal Selection Algorithm (ICLONALG) to classify the eyesight’s problems. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: