Search Results - (( process setting graph algorithm ) OR ( java application testing algorithm ))

Search alternatives:

Refine Results
  1. 1
    Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing

    Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing by Husna, Jamal Abdul Nasir

    Published 2011
    “…A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against existing grid resource management algorithms such as Antz algorithm, Particle Swarm Optimization algorithm, Space Shared algorithm and Time Shared algorithm, in terms of processing time and resource utilization. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  2. 2
    Dynamical fuzzy autocatalytic set of combustion process in circulating fluidized bed boiler using transition matrix / Hazwani Hashim

    Dynamical fuzzy autocatalytic set of combustion process in circulating fluidized bed boiler using transition matrix / Hazwani Hashim by Hashim, Hazwani

    Published 2014
    “…A chemical reaction occurring during combustion process in circulating fluidized bed boiler (CFB) has been modeled using concept of Fuzzy Autocatalytic Set (FACS) of fuzzy graph type-3 whereby fifteen important species identified in the process are represented as nodes and catalytic relationship among the species are represented by fuzzy edges in the graph. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  3. 3
    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:
  4. 4
    Static and dynamic graphs modeling of a boiler system / Noor Ainy Harish

    Static and dynamic graphs modeling of a boiler system / Noor Ainy Harish by Harish, Noor Ainy

    Published 2015
    “…Next, to obtain an explanation of the dynamic nature of the system, a Dynamic Autocatalytic Set Graph Algorithm (DAGA) is presented which succesfully explained the dynamics of the real processes in the boiler. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    FROM IMAGE TO GRAPH-BASED DATA FOR PATH PLANNING

    FROM IMAGE TO GRAPH-BASED DATA FOR PATH PLANNING by MOHAMAD YATIM, NOOR AMANINA HANISAH

    Published 2019
    “…This implementation of graph traversal, statistics and machine learning algorithms were a challenging part to be done. …”
    Get full text
    Get full text
    Final Year Project
    Save to List
    Saved in:
  6. 6
    An Improved-Time Polynomial-Space Exact Algorithm For TSP In Degree-5 Graphs

    An Improved-Time Polynomial-Space Exact Algorithm For TSP In Degree-5 Graphs by Md Yunos, Norhazwani, Shurbevski, Aleksandar, Nagamochi, Hiroshi

    Published 2017
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  7. 7
    Modeling of static and dynamic components of bio-nanorobotic systems

    Modeling of static and dynamic components of bio-nanorobotic systems by Gavgani, Hamidreza Khataee

    Published 2012
    “…The first modeling technique applies graph algorithms to compute a new set of optimal weighted structural properties of C60 and C70 fullerenes. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  8. 8
    RSA Encryption & Decryption using JAVA

    RSA Encryption & Decryption using JAVA by Ramli, Marliyana

    Published 2006
    “…The implementation of this project will be based on Rapid Application Design Methodology (RAD) and will be more focusing on research and finding, ideas and the implementation of the algorithm, and finally running and testing the algorithm. …”
    Get full text
    Get full text
    Final Year Project
    Save to List
    Saved in:
  9. 9
    Design and analysis of DNA fragment assembly's converter and checker modules using De Bruijin Graph / Mohd Shafiq Mohd Helmi

    Design and analysis of DNA fragment assembly's converter and checker modules using De Bruijin Graph / Mohd Shafiq Mohd Helmi by Mohd Helmi, Mohd Shafiq

    Published 2012
    “…Hybridization uses the array identifying algorithm to identify the sequence. The algorithm used to construct the module is Bruijn Graph. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    Design and analysis of DNA fragment assembly's converter and checker modules using De Bruijin Graph : article / Mohd Shafiq Mohd Helmi

    Design and analysis of DNA fragment assembly's converter and checker modules using De Bruijin Graph : article / Mohd Shafiq Mohd Helmi by Mohd Helmi, Mohd Shafiq

    Published 2012
    “…Hybridization uses the array identifying algorithm to identify the sequence. The algorithm used to construct the module is Bruijn Graph. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  11. 11
    An Improved of Channel Allocation for WLAN Using Vertex Merge Algorithm

    An Improved of Channel Allocation for WLAN Using Vertex Merge Algorithm by Mr, Handrizal, Mr, Muhammad Zarlis, Noraziah, Ahmad, Abdalla, Ahmed N.

    Published 2012
    “…Graph colouring is a useful algorithm for channel allocation on wireless local area network (WLAN). …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  12. 12
    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
    “…Several interesting and challenging methods have used to formulate distinct circuits but this research is motivated through the process of wings movement in butterfly to develop distinct circuits from complete graphs. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  13. 13
    The conceptual framework of knowledge of large scale and incomplete graphs of skyline queries optimization using machine learning

    The conceptual framework of knowledge of large scale and incomplete graphs of skyline queries optimization using machine learning by Noor, Ubair, Hassan, Raini, Dwi Handayani, Dini Oktarina

    Published 2025
    “…The research aims at proposing a new model for processing skyline queries in an incomplete graph database. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceeding Paper
    Save to List
    Saved in:
  14. 14
    Quantum Processing Framework And Hybrid Algorithms For Routing Problems

    Quantum Processing Framework And Hybrid Algorithms For Routing Problems by Soltan Aghaei, Mohammad Reza

    Published 2010
    “…A typical component in QPU is a quantum device that runs quantum algorithms; namely Quantum Algorithm Processing Unit (QAPU). …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    Priority and dynamic quantum time algorithms for central processing unit scheduling

    Priority and dynamic quantum time algorithms for central processing unit scheduling by Mohammed, Maysoon A.

    Published 2018
    “…Central Processing Unit is scheduled using different types of scheduling algorithms. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    Comparison of Search Algorithms in Javanese-Indonesian Dictionary Application

    Comparison of Search Algorithms in Javanese-Indonesian Dictionary Application by Yana Aditia, Gerhana, Nur, Lukman, Arief Fatchul, Huda, Cecep Nurul, Alam, Undang, Syaripudin, Devi, Novitasari

    Published 2020
    “…Performance Testing is used to test the performance of algorithm implementations in applications. …”
    Get full text
    Get full text
    Journal
    Save to List
    Saved in:
  17. 17
    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:
  18. 18
    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
    “…De Bruijn graph is one of the assembly algorithms that are widely used for short reads sequences produced from NGS platforms. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  19. 19
    A constructive approach to examination timetabling based on adaptive decomposition and ordering

    A constructive approach to examination timetabling based on adaptive decomposition and ordering by Abdul Rahman, Syariza, Burke, Edmund K., Bargiela, Andrzej, McCollum, Barry, Özcan, Ender

    Published 2014
    “…Moreover, the examinations within each set are ordered using different strategies based on graph colouring heuristics.Initially, the examinations are placed into the easy set. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    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:

Search Tools: