Search Results - (( java application optimization algorithm ) OR ( set generation graph algorithm ))

Search alternatives:

Refine Results
  1. 1
    Butterfly Triple System Algorithm Based on Graph Theory

    Butterfly Triple System Algorithm Based on Graph Theory by Ibrahim, Haslinda, Aldiabat, Raja’i, Karim, Sharmila

    Published 2022
    “…In combinatorial design theory, clustering elements into a set of three elements is the heart of classifying data, which has recently received considerable attention in the fields of network algorithms, cryptography, design and analysis of algorithms, statistics, and Information theory. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  2. 2
    Implementation of Graph Based Path Planning Algorithms on a Mobile Robot in a Confined Site

    Implementation of Graph Based Path Planning Algorithms on a Mobile Robot in a Confined Site by TANG, HON PANN

    Published 2017
    “…This project investigates the performance of three different graph based path planning algorithms used, relaxed A*, A* and Dijkstra’s algorithm in a few environments with different obstacles settings using Gazebo environment simulator and Turtlebot simulator (computer simulation) and 4WD navigation robot (real environment simulation).…”
    Get full text
    Get full text
    Final Year Project
    Save to List
    Saved in:
  3. 3
    Representation of half wing of butterfly and hamiltonian circuit for complete graph using starter set method

    Representation of half wing of butterfly and hamiltonian circuit for complete graph using starter set method by Karim, Sharmila, Ibrahim, Haslinda, Mohd Darus, Maizon

    Published 2019
    “…We provide an example for case n = 4 and 5 to exemplify the algorithms. Furthermore, the calculation for order of complexity is also presented for generating distinct half wing and hamiltonian circuit using starter set method.…”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  4. 4
    A hybrid local search algorithm for minimum dominating set problems

    A hybrid local search algorithm for minimum dominating set problems by Abed, S.A., Rais, H.M., Watada, J., Sabar, N.R.

    Published 2022
    “…This algorithm focuses on generating promising solutions in different areas of the solution space using the problem search history. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  5. 5
    A hybrid local search algorithm for minimum dominating set problems

    A hybrid local search algorithm for minimum dominating set problems by Abed, S.A., Rais, H.M., Watada, J., Sabar, N.R.

    Published 2022
    “…This algorithm focuses on generating promising solutions in different areas of the solution space using the problem search history. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  6. 6
    Optimization of blood vessel detection in retina images using multithreading and native code for portable devices

    Optimization of blood vessel detection in retina images using multithreading and native code for portable devices by Tran, Duc Ngoc, Hussin, Fawnizu Azmadi, Yusoff, Mohd Zuki

    Published 2013
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  7. 7
    Performance evaluation of real-time multiprocessor scheduling algorithms

    Performance evaluation of real-time multiprocessor scheduling algorithms by Alhussian, H., Zakaria, N., Abdulkadir, S.J., Fageeri, S.O.

    Published 2016
    “…These results suggests that optimal algorithms may turn to be non-optimal when practically implemented, unlike USG which reveals far less scheduling overhead and hence could be practically implemented in real-world applications. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  8. 8
    Route Optimization System

    Route Optimization System by Zulkifli, Abdul Hayy

    Published 2005
    “…After much research into the many algorithms available, and considering some, including Genetic Algorithm (GA), the author selected Dijkstra's Algorithm (DA). …”
    Get full text
    Get full text
    Final Year Project
    Save to List
    Saved in:
  9. 9
    Performance analysis of bacterial genome assemblers using illumina next generation sequencing data / Nur ‘ Ain Mohd Ishak

    Performance analysis of bacterial genome assemblers using illumina next generation sequencing data / Nur ‘ Ain Mohd Ishak by Nur ‘ Ain , Mohd Ishak

    Published 2020
    “…In this study, the performance of four de novo assemblers (SPAdes, ABySS, Velvet and MaSuRCA) is reported, in which variants of de Brujin graph algorithms are applied, using genomic data generated by the Illumina sequencing platform. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    A new technique for improving the dispersion of a set of samples. Application in multi-query motion planning

    A new technique for improving the dispersion of a set of samples. Application in multi-query motion planning by Khaksar W., Hong T.S., Sahari K.S.B.M., Khaksar M.

    Published 2023
    “…In this paper, we proposed a new learning strategy for probabilistic roadmap (PRM) algorithm. The proposed strategy is based on reducing the dispersion of the generated set of samples. …”
    Conference Paper
    Save to List
    Saved in:
  11. 11
    A low dispersion probabilistic roadmaps (LD-PRM) algorithm for fast and efficient sampling-based motion planning

    A low dispersion probabilistic roadmaps (LD-PRM) algorithm for fast and efficient sampling-based motion planning by Khaksar, Weria, Tang, Sai Hong, Khaksar, Mansoor, Motlagh, Omid Reza Esmaeili

    Published 2013
    “…In this paper, we propose a new learning strategy for a probabilistic roadmap (PRM) algorithm. The proposed strategy is based on reducing the dispersion of the generated set of samples. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    Automatic Number Plate Recognition on android platform: With some Java code excerpts

    Automatic Number Plate Recognition on android platform: With some Java code excerpts by ., Abdul Mutholib, Gunawan, Teddy Surya, Kartiwi, Mira

    Published 2016
    Get full text
    Get full text
    Get full text
    Book
    Save to List
    Saved in:
  13. 13
    Attribute reduction based scheduling algorithm with enhanced hybrid genetic algorithm and particle swarm optimization for optimal device selection

    Attribute reduction based scheduling algorithm with enhanced hybrid genetic algorithm and particle swarm optimization for optimal device selection by Nwogbaga, Nweso Emmanuel, Latip, Rohaya, Affendey, Lilly Suriani, Abdul Rahiman, Amir Rizaan

    Published 2022
    “…Enhance hybrid genetic algorithm and particle Swarm optimization are developed to select the optimal device in either fog or cloud. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    Generic DNA encoding design scheme to solve combinatorial problems

    Generic DNA encoding design scheme to solve combinatorial problems by Rofilde, Hasudungan

    Published 2015
    “…It involves finding groupings, ordering, or assignment of a discrete; finite set of objects that satisfy given conditions. The complexity of combinatorial problems is classified as NP meaning that algorithms are yet to exist to efficiently solve the problem. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    A low dispersion probabilistic roadmaps (LD-PRM) algorithm for fast and efficient sampling-based motion planning

    A low dispersion probabilistic roadmaps (LD-PRM) algorithm for fast and efficient sampling-based motion planning by Khaksar W., Hong T.S., Khaksar M., Motlagh O.

    Published 2023
    “…In this paper, we propose a new learning strategy for a probabilistic roadmap (PRM) algorithm. The proposed strategy is based on reducing the dispersion of the generated set of samples. …”
    Article
    Save to List
    Saved in:
  16. 16
    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
    “…In addition, a comparative study on the laser simulator approach, A* algorithm, Voronoi diagram with fast marching and PointBug algorithms was performed to show the benefits and drawbacks of the proposed approach. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    Tracing active power between generators and loads for transmission open access

    Tracing active power between generators and loads for transmission open access by Zanariah Zainol

    Published 2009
    Get full text
    Learning Object
    Save to List
    Saved in:
  18. 18
    Ant colony optimization algorithm for load balancing in grid computing

    Ant colony optimization algorithm for load balancing in grid computing by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

    Published 2012
    Get full text
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:
  19. 19
    Design and statistical analysis of initial solution construction approach in curriculum based course timetabling problem

    Design and statistical analysis of initial solution construction approach in curriculum based course timetabling problem by Wahid, Juliana, Mohd Hussin, Naimah

    Published 2017
    “…This process is a crucial task because it can affect the convergence speed and also the quality of the final solution (Rahnamayan, Tizhoosh, & Salama, 2007).This study able to produce a set of initial solution, therefore it is able to contribute to the improvement phase of approach that uses population of initial solutions such as ant colony optimization (ACO) (Socha, Joshua, & Michael, 2002), genetic algorithm (GA) (Lewis & Paechter, 2005), and harmony search algorithm (HSA) (Al-Betar & Khader, 2010).The approach in this study also shows that a feasible timetable can be found for numerous data set problems.…”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  20. 20
    Bipartite graph approach to course timetabling problems / Hafizah A Razak

    Bipartite graph approach to course timetabling problems / Hafizah A Razak by A Razak, Hafizah

    Published 2009
    “…The prototype is design using constructive heuristic algorithm and colouring the edge of two bipartite graphs. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: