Search Results - (( java implementation path algorithm ) OR ( using chain based 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
    Energy-efficient two-stage chain protocol routing algorithm for wireless sensor networks

    Energy-efficient two-stage chain protocol routing algorithm for wireless sensor networks by Farhan, Husam Kareem

    Published 2014
    “…The new TSCP routing algorithm is compared with other similar grid-based routing algorithms namely Chain-Cluster based Mixed routing (CCM) and Chain-Chain Based Routing Protocol (CCBRP). …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  6. 6
    Multi-base number representation in application to scalar multiplication and pairing computation

    Multi-base number representation in application to scalar multiplication and pairing computation by Mohammed Ismail, Abdelwahed

    Published 2011
    “…Multi-bases number representation is used to construct new versions of Miller’s algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  7. 7
    Development of computer aided three-dimensional geometric modeler based on designer's idea in twodimensional

    Development of computer aided three-dimensional geometric modeler based on designer's idea in twodimensional by Haron, Habibollah

    Published 2006
    “…These algorithm are used to produce chain code series that represented a thinned binary image of the sketch. …”
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:
  8. 8
    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
    “…A depth - first search algorithm is used to search for optimal chaining. Theorems on number of branches needed to be explored at each node of search tree are derived. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    Computation of cryptosystem based on Lucas functions using addition chain

    Computation of cryptosystem based on Lucas functions using addition chain by Md Ali, Zulkarnain, Othman, Mohamed, Md. Said, Mohamad Rushdan, Sulaiman, Md. Nasir

    Published 2010
    “…It is based on Addition Chain. The computation time for existing and new algorithms will be recorded. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  10. 10
    Aplikasi rangkaian neural dalam pengesanan simpang bagi penterjemah lakaran pintar

    Aplikasi rangkaian neural dalam pengesanan simpang bagi penterjemah lakaran pintar by Subri, Syarul Haniz

    Published 2006
    “…Back propagation neural network algorithm was used to develop and produce the classifier for corner detector algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    Chain code algorithm in deriving T-Junction and region of a freehand sketch

    Chain code algorithm in deriving T-Junction and region of a freehand sketch by Haron, Habibollah, Shamsuddin, Siti Mariyam, Mohamed, Dzulkifli

    Published 2004
    “…The algorithm is based on 8-connected 3x3 windows of Freeman chain code. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    A new corner detection algorithm for chain code representation.

    A new corner detection algorithm for chain code representation. by Haron , Habibollah, Shamsuddin , Siti Mariyam, Mohamed, Dzulkifli

    Published 2005
    “…The algorithm is based on chain-coded image, deriving the slope between each code, analyze the series of chain code, and finally decide the existence of corner at the current pixel location. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  13. 13
    Bilinear pairings computation using the extended double-base chains algorithm

    Bilinear pairings computation using the extended double-base chains algorithm by Mohammed Ismail, Abdulwahed, Md. Said, Mohamad Rushdan, Mohd Atan, Kamel Ariffin, Rakhimov, Isamiddin Sattarovich

    Published 2010
    “…The computation efficiency of the Weil and Tate pairings mainly depends on the efficiency of the EC scalar multplications algorithms used. In this paper, we compute the Tate pairing using multi-base number representation(MBNR) system in scalar multiplication instead of using binary representation as used in Miller’s algorithm and in the double-base (DB) chain used by Changan Zhao et al. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    Genetic Algorithm based Chain Leader Election in Wireless Sensor Network for Precision Farming

    Genetic Algorithm based Chain Leader Election in Wireless Sensor Network for Precision Farming by Hamzarul Alif Hamzah, Norah Tuah, Lim, Kit Guan, Tan, Min Keng, Ismail Saad, Tze, Kenneth,Kin Teo

    Published 2020
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  15. 15
    Detection of head position using chain code algorithm

    Detection of head position using chain code algorithm by Fuad, Norfaiza

    Published 2007
    “…The main contribution of this thesis is it contributes an algorithm of head recognition and detecting which based on image segmentation, Prewitt edge detection and Chain Code algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    Detection of head position using chain code algorithm

    Detection of head position using chain code algorithm by Fuad, Norfaiza

    Published 2007
    “…The main contribution of this thesis is it contributes an algorithm of head recognition and detecting which based on image segmentation, Prewitt edge detection and Chain Code algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    The implementation of forward chaining algorithm in calculating inheritance property based on faraid law / Nur Ain Syafiqah Mohammad Marzuki

    The implementation of forward chaining algorithm in calculating inheritance property based on faraid law / Nur Ain Syafiqah Mohammad Marzuki by Mohammad Marzuki, Nur Ain Syafiqah

    Published 2021
    “…Therefore, the purpose of this study is to facilitate the use of Forward Chaining Algorithm to calculate Faraid based on inheritance division. …”
    Get full text
    Get full text
    Student Project
    Save to List
    Saved in:
  18. 18
    Energy efficient Two Stage Chain Routing Protocol (TSCP) for wireless sensor networks

    Energy efficient Two Stage Chain Routing Protocol (TSCP) for wireless sensor networks by Kareem, Husam, Hashim, Shaiful Jahari, Subramaniam, Shamala, Sali, Aduwati

    Published 2014
    “…The main objectives of TSCP is to minimize the total energy consumption, achieve more load balancing and increase the network lifetime with more stability compared with other routing algorithms, for examples Chain-Cluster based Mixed routing (CCM) and Chain-Chain Based Routing Protocol (CCBRP). …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    Enhanced algorithms for three-dimensional object interpreter

    Enhanced algorithms for three-dimensional object interpreter by Haron, Habibollah

    Published 2004
    “…The second is the modified Freeman chain code algorithm that is used to produce chain code series that represented a thinned binary image of the sketch. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    Synthesis of transistor chaining algorithm for CMOS cell layout using euler path / Sukri Hanafiah

    Synthesis of transistor chaining algorithm for CMOS cell layout using euler path / Sukri Hanafiah by Hanafiah, Sukri

    Published 1997
    “…After discussing about the introduction (the basic of CMOS transistor ), we will discuss how to create the Optimal layout of CMOS Functional Array with the minimum separation based on euler path method. The euler's path it using pseudo input and Heuristic algorithm to find the minimum interlace. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: