Search Results - (( based testing graph algorithm ) OR ( java implication based algorithm ))

Refine Results
  1. 1

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

    Published 2007
    “…Results of the performance tests on the proposed hardware graph accelerator, graph computations are significantly improved in terms of algorithm complexity and execution speed.…”
    Get full text
    Get full text
    Get full text
    Thesis
  2. 2

    Graph coloring program of exam scheduling modeling based on bitwise coloring algorithm using python by Arifin, Samsul, Muktyas, Indra Bayu, Al Maki, Wikky Fawwaz, Mohd Khairul Bazli, Mohd Aziz

    Published 2022
    “…In this article, the researchers design an algorithm and apply it to a computer program (Python) to solve graph coloring and to visualize the variation of exam scheduling modeling at Binus University in graphs based on the Bitwise Graph Coloring Algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
  3. 3

    Predicting future sales using genetic algorithm: data mining sales / Siti Hajar Yaacob by Yaacob, Siti Hajar

    Published 2014
    “…The main purpose of this research to test whether Genetic Algorithm can use to predict future sales and be able generates the graph. …”
    Get full text
    Get full text
    Thesis
  4. 4

    Regression test case selection & prioritization using dependence graph and genetic algorithm by Musa, Samaila, Md Sultan, Abu Bakar, Abd Ghani, Abdul Azim, Baharom, Salmi

    Published 2014
    “…Unfortunately, it is costly and time consuming to allow for the re-execution of all test cases during regression testing. The challenge in regression testing is the selection of best test cases from the existing test suite.This paper presents an evolutionary regression test case prioritization for object-oriented software based on extended system dependence graph model of the affected program using genetic algorithm. …”
    Get full text
    Get full text
    Article
  5. 5

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

    Published 1997
    “…This project implement a algorithm for the optimal transistor chaining problem in CMOS functional cell layout based on Uehara and vanCleemput's layout style [1] which assumed that the height of each logic module layout is constant and performed the optimisation by decomposing the graph module into a minimum number of sub graph having a dual Euler (d-Euler) trail.. …”
    Get full text
    Get full text
    Thesis
  6. 6

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

    Published 2012
    “…The analysis and comparison of VIGA-20 is based on convergence test against the results obtained from the Simple Genetic Algorithm. …”
    Get full text
    Get full text
    Thesis
  7. 7

    A regression test case selection and prioritization for object-oriented programs using dependency graph and genetic algorithm by Musa, Samaila, Md Sultan, Abu Bakar, Abd Ghani, Abdul Azim, Baharom, Salmi

    Published 2014
    “…This paper presents an evolutionary regression test case prioritization for object-oriented software based on dependence graph model analysis of the affected program using Genetic Algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
  8. 8

    Max degree around (MDA) algorithm: a smart and efficient approximate algorithm for Vertex cover and independent set problems by Fayaz, Muhammad, Arshad, S, Shah, A.S, Shah, Asadullah

    Published 2016
    “…The proposed algorithm performed well as compared to counterpart algorithms tested on graphs with up to 1000 vertices and 150,000 vertices for Minimum Vertex Cover (MVC) and Maximum Independent Set (MIS).…”
    Get full text
    Get full text
    Get full text
    Article
  9. 9

    Retrieval Of Environmental Parameters Over Water Areas Using MODIS Data by Amin, Abd Rahman Mat

    Published 2012
    “…The accuracy of the algorithm was tested and determined.…”
    Get full text
    Get full text
    Thesis
  10. 10

    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
  11. 11

    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
  12. 12
  13. 13

    A multi-view clustering algorithm for attributed weighted multi-edge directed networks by Khameneh, Azadeh Zahedi, Kilicman, Adem, Mahad, Zahari

    Published 2022
    “…Our algorithm first converts the given AWMEDiG into a new weighted graph. …”
    Get full text
    Get full text
    Article
  14. 14

    Multi-objective pareto ant colony system based algorithm for generator maintenance scheduling by Shimailawi, Shatha Abdulhadi Muthana

    Published 2022
    “…A multi-objective PACS algorithm based on sequential strategy which considers unit commitment and GMS problem separately is proposed to obtain solution for a proposed GMS model. …”
    Get full text
    Get full text
    Get full text
    Thesis
  15. 15

    Effects of Different Superpixel Algorithms on Interactive Segmentations by Soo See, Chai, Luong Goh, Kok, Weng Ng, Giap, Muzaffar, Hamzah

    Published 2022
    “…The superpixels generated by these five algorithms will be used on two interactive image segmentation algorithms: i) Maximal Similarity based Region Merging (MSRM) and ii) Graph-Based Manifold Ranking (GBMR) with single and multiple strokes on various images from the Berkeley image dataset. …”
    Get full text
    Get full text
    Get full text
    Article
  16. 16

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

    Published 2012
    “…Global pheromone update is performed after the completion of processing the jobs in order to reduce the pheromone value of resources.A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against other ant based algorithm, in terms of resource utilization. …”
    Get full text
    Get full text
    Get full text
    Monograph
  17. 17

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

    Published 2022
    “…Compared to the literature, the proposed algorithm outperformed other algorithms in most of the tested instances. …”
    Get full text
    Get full text
    Article
  18. 18

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

    Published 2022
    “…Compared to the literature, the proposed algorithm outperformed other algorithms in most of the tested instances. …”
    Get full text
    Get full text
    Article
  19. 19

    Combinatorial test suites generation strategy utilizing the whale optimization algorithm by Ali Abdullah, Hassan, Salwani, Abdullah, Kamal Zuhairi, Zamli, Rozilawati, Razali

    Published 2020
    “…The experimental results of the test-suite generation indicate that WOA produces competitive outcomes compared to some selected single-based and population-based metaheuristic algorithms.…”
    Get full text
    Get full text
    Get full text
    Article
  20. 20

    Effects of Different Superpixel Algorithms on Interactive Segmentations by Goh, Kok Luong, Ng, Giap Weng, Muzaffar Hamzah, Chai, Soo See

    Published 2022
    “…The superpixels generated by these five algorithms will be used on two interactive image segmentation algorithms: i) Maximal Similarity based Region Merging (MSRM) and ii) Graph-Based Manifold Ranking (GBMR) with single and multiple strokes on various images from the Berkeley image dataset. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article