Search Results - (( developing a graph algorithm ) OR ( java data optimization algorithm ))

Search alternatives:

Refine Results
  1. 1
    Fuzzy modeling using Bat Algorithm optimization for classification

    Fuzzy modeling using Bat Algorithm optimization for classification by Noor Amidah, Ahmad Sultan

    Published 2018
    “…A Sazonov Engine which is a fuzzy java engine is use to apply Bat Algorithm in the experiment. …”
    Get full text
    Get full text
    Get full text
    Undergraduates Project Papers
    Save to List
    Saved in:
  2. 2
    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
    “…Therefore, in this paper, we proposed Dynamic tasks scheduling algorithm based on attribute reduction with an enhanced hybrid Genetic Algorithm and Particle Swarm Optimization for optimal device selection. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  3. 3
    Graph coloring program of exam scheduling modeling based on bitwise coloring algorithm using python

    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
    “…The researchers develop a graph coloring algorithm by considering some of the graph vertices to be binary numbers. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  4. 4
    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
    “…Graph coloring is an assignment a color to each vertex, which each vertex that adjacent is given a different color. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    Graph processing hardware accelerator for shortest path algorithms in nanometer very large-scale integration interconnect routing

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

    Published 2007
    “…It has been shown that the performance of a graph-based shortest path algorithm can severely be affected by the performance of its priority queue. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  6. 6
    Graph-Based Algorithm With Self-Weighted And Adaptive Neighbours Learning For Multi-View Clustering

    Graph-Based Algorithm With Self-Weighted And Adaptive Neighbours Learning For Multi-View Clustering by He, Yanfang

    Published 2024
    “…To address this issue, this study incorporated joint graph learning from the gmc algorithm into swmcan, creating a new algorithm called swmcan-jg. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  7. 7
    Ant colony optimization based subset feature selection in speech processing: Constructing graphs with degree sequences

    Ant colony optimization based subset feature selection in speech processing: Constructing graphs with degree sequences by Rajesvary Rajoo R., Salam R.A.

    Published 2024
    journal::journal article
    Save to List
    Saved in:
  8. 8
    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
    “…The Traveling Salesman Problem (TSP) is one of the most well-known NP-hard optimization problems. Following a recent trend of research which focuses on developing algorithms for special types of TSP instances, namely graphs of limited degree, in an attempt to reduce a part of the time and space complexity, we present a polynomial-space branching algorithm for the TSP in an n-vertex graph with degree at most 5, and show that it has a running time of O∗(2.3500n), which improves the previous best known time bound of O∗(2.4723n) given by the authors (the 12th International Symposium on Operations Research and Its Application (ISORA 2015), pp.45–58, 2015). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  9. 9
    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
    “…Basically, in this algorithm development, a starter of cyclic near-resolvable ((v-1)/2)-cycle system of the 2-fold complete graph 2Kvis employed to construct the starter of cyclic ((v-1)/2)-star decomposition of 2Kv. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    A random search based effective algorithm for pairwise test data generation

    A random search based effective algorithm for pairwise test data generation by Sabira, Khatun, K. F., Rabbi, Che Yahaya, Yaakub, Klaib, Mohammad F. J.

    Published 2011
    “…This paper proposes an effective random search based pairwise test data generation algorithm named R2Way to optimize the number of test cases. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  11. 11
    Optimizing kindergarten schedule using : graph coloring / Nur Nabilah Salleh Muner

    Optimizing kindergarten schedule using : graph coloring / Nur Nabilah Salleh Muner by Salleh Muner, Nur Nabilah

    Published 2019
    “…The greedy algorithm was used to color the graph and it was supported by the C++ program. …”
    Get full text
    Get full text
    Research Reports
    Save to List
    Saved in:
  12. 12
    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:
  13. 13
    VISUALIZATION OF GENETIC ALGORITHM BASED ON 2-D GRAPH TO ACCELERATE THE SEARCHING WITH HUMAN INTERVENTIONS.

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

    Published 2012
    “…A tool termed as VIGA-20 (Visualization of Genetic Algorithm using 2-0 Graph) is implemented to accomplish this goal. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  14. 14
    Scalable approach for mining association rules from structured XML data

    Scalable approach for mining association rules from structured XML data by Abazeed, Ashraf Riad, Mamat, Ali, Sulaiman, Md. Nasir, Ibrahim, Hamidah

    Published 2009
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  15. 15
    EasyA: Easy and effective way to generate pairwise test data

    EasyA: Easy and effective way to generate pairwise test data by Rabbi, Khandakar Fazley, Sabira, Khatun, Che Yahaya, Yaakub, Klaib, Mohammad F. J.

    Published 2013
    “…This paper proposes a matrix based calculation for pairwise test data generation algorithm named EasyA to optimize the number of test cases. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  16. 16
    An ensemble learning method for spam email detection system based on metaheuristic algorithms

    An ensemble learning method for spam email detection system based on metaheuristic algorithms by Behjat, Amir Rajabi

    Published 2015
    “…In the second phase, a classifier ensemble learning model is proposed consisting of separate outputs: (i) To select a relevant subset of original features based on Binary Quantum Gravitational Search Algorithm (QBGSA), (ii) To mine data streams using various data chunks and overcome a failure of single classifiers based on SVM, MLP and K-NN algorithms. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    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
    “…Thus it leads to the establishment of an improvised Graph Dynamics Algorithm which is used to assist the analysis of graph dynamics of FACS in CFB. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  18. 18
    COVID-19 DATA EXPLORATION USING MAPPER ALGORITHM

    COVID-19 DATA EXPLORATION USING MAPPER ALGORITHM by Carey, Ling Yu Fan

    Published 2023
    “…Application of mapper algorithm through Kepler Mapper, a python implementation of mapper is done to construct mapper graphs for state wise COVID�19 data in Malaysia along year 2021. …”
    Get full text
    Get full text
    Final Year Project Report / IMRAD
    Save to List
    Saved in:
  19. 19
    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
    “…Thus, other concept namely Autocatalytic Set (ACS) was applied in developing a new graph which could explain a dynamic nature of a processes in the boiler system. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    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:

Search Tools: