Search Results - (( developing complex graph algorithm ) OR ( java implication based algorithm ))

Search alternatives:

Refine Results
  1. 1
    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:
  2. 2
    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
    “…For design validation and performance test purposes, a computationally expensive VLSI interconnect routing Computer Aided Design (CAD) module is developed. 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
    Save to List
    Saved in:
  3. 3
    Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator: article

    Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator: article by Othman, Nor Shuhaida

    Published 2010
    “…The existing Smith-Waterman algorithm had complex memory and low performance where the time also was consumed caused by high sensitivity of the large sequences long. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  4. 4
    Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator

    Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator by Othman, Nor Shuhaida

    Published 2010
    “…The existing Smith-Waterman algorithm had complex memory and low performance where the time also was consumed caused by high sensitivity of the large sequences long. …”
    Get full text
    Get full text
    Student Project
    Save to List
    Saved in:
  5. 5
    Parameter estimation of multivariable system using Fuzzy State Space Algorithm / Razidah Ismail … [et al.]

    Parameter estimation of multivariable system using Fuzzy State Space Algorithm / Razidah Ismail … [et al.] by Ismail, Razidah, Ahmad, Tahir, Harish, Noor Ainy, A. Halim, Rosenah

    Published 2011
    “…Fuzzy State Space Model (FSSM) was developed to cope with the demand and performance due to the increase in the system complexity. …”
    Get full text
    Get full text
    Research Reports
    Save to List
    Saved in:
  6. 6
    COVID-19 DATA EXPLORATION USING MAPPER ALGORITHM

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

    Published 2023
    “…The resulting mapper graphs reveal the pandemic’s development progress across time and place during year 2021. …”
    Get full text
    Get full text
    Final Year Project Report / IMRAD
    Save to List
    Saved in:
  7. 7
    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
    “…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:
  8. 8
    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:
  9. 9
    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
    “…A novel technique called laser simulator approach for visibility search graph-based path planning has been developed in this article to determine the optimum collision-free path in unknown environment. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    A Divide-and-Distribute Approach to Single-Cycle Learning HGN Network for Pattern Recognition

    A Divide-and-Distribute Approach to Single-Cycle Learning HGN Network for Pattern Recognition by Muhamad Amin , Anang Hudaya, Khan, Asad I.

    Published 2010
    “…Distributed Hierarchical Graph Neuron (DHGN) is a single-cycle learning distributed pattern recognition algorithm, which reduces the computational complexity of existing pattern recognition algorithms by distributing the recognition process into smaller clusters. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  11. 11
    Robust overlapping community detection in complex networks with graph convolutional networks and fuzzy C-means

    Robust overlapping community detection in complex networks with graph convolutional networks and fuzzy C-means by Mohammed Al-Andoli, Mohammed Nasser, Che Ku Mohd, Che Ku Nuraini, Harny, Irianto, Jamil Alsayaydeh, Jamil Abedalrahim, Alwayle, Ibrahim M., Ahmed Abuhoureyah, Fahd Saad

    Published 2024
    “…In this paper, we propose an efficient method called GCNFCM, which utilizes Graph Convolutional Networks (GCNs), Fuzzy C-means (FCM), and the modularity Q algorithm for overlapping community detection. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    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
    “…Another quantum algorithm for a minimum weight spanning tree in the graph was also designed. …”
    Get full text
    Get full text
    Thesis
    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
    “…These continuous updates makes the graph to be highly dynamic, where nodes/edges are added to or removed from the graph always. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceeding Paper
    Save to List
    Saved in:
  14. 14
    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:
  15. 15
    Graph-based conflict rectification using stroke gesture approach in timetabling system (CORECTS)

    Graph-based conflict rectification using stroke gesture approach in timetabling system (CORECTS) by Yong, Tien Fui, Choo, Wou Onn, Chue, Wen Yeen, Kok, Hui Meian

    Published 2010
    “…CORECTS will apply a hybrid method using annealing graph algorithm and the proposed STAR-quadrants to display the conflict detection of the entire timetable.Simple stroke gesture is used to expedite the conflict resolution process. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  16. 16
    Case study: Optimisation of Federal Land Development Authority Jengka supply chain management using P-graph approach

    Case study: Optimisation of Federal Land Development Authority Jengka supply chain management using P-graph approach by Haleem, A.A., Hashim, H., Varbanov, P.S., Yong, J.Y., Klemeš, J.J., Yusup, S.

    Published 2015
    “…To address this issue, P-graph modelling is used as the methodology to solve combinatorial complexity of the biomass supply chain in Federal Land Development Authority Jengka. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    A comparative study of interactive segmentation with different number of strokes on complex images

    A comparative study of interactive segmentation with different number of strokes on complex images by Kok, Luong Goh, Giap, Weng Ng, Muzaffar Hamzah, Soo, See Chai

    Published 2020
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    High Rise Building Evacuation Route Model Using DIJKSTRA'S Algorithm

    High Rise Building Evacuation Route Model Using DIJKSTRA'S Algorithm by Mohd Sabri, Nor Amalina

    Published 2015
    “…Evacuation of high rise building has become an issue nowadays as the modern development has increased tremendously with a very complex structure and design. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  19. 19
    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:
  20. 20
    A Comparative Study of Interactive Segmentation with Different Number of Strokes on Complex Images

    A Comparative Study of Interactive Segmentation with Different Number of Strokes on Complex Images by Goh, Kok Luong, Ng, Giap Weng, Muzaffar, Hamzah, Chai, Soo See

    Published 2020
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: