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

  • Showing 1 - 13 results of 13
Refine Results
  1. 1

    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
  2. 2
  3. 3
  4. 4

    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
  5. 5
  6. 6

    Power system intentional islanding for different contingency scenarios using discrete optimization technique by Nur Zawani Binti Saharuddin

    Published 2023
    “…The initial intentional islanding solution was determined using graph theory approach, to facilitate the proposed MDEP algorithm in determining the optimal intentional islanding strategy. …”
    text::Thesis
  7. 7

    Nonlinear convergence algorithm: structural properties with doubly stochastic quadratic operators for multi-agent systems by Abdulghafor, Rawad Abdulkhaleq Abdulmolla, Turaev, Sherzod, Zeki, Akram M., Adamu, Abubakar Ibrahim

    Published 2018
    “…We develop two algorithms: 1) the nonlinear algorithm of extreme doubly stochastic quadratic operator (NLAEDSQO) to generate all the convergent EDSQOs and 2) the nonlinear convergence algorithm (NLCA) of EDSQOs to investigate the optimal consensus for MAS. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  8. 8

    Boolean routing on high degree chordal ring networks by Matroud Bashi, Atheer Abbas

    Published 2001
    “…All compact routing techniques minimise time and space complexity. A good routing algorithm optimises the time and space complexity and a routing algorithm that has O(1) time complexity and O(log n) space complexity for high degree chordal ring has been found. …”
    Get full text
    Get full text
    Thesis
  9. 9

    Modification of particle swarm optimization algorithm for optimization of discrete values by Mohd Yassin, Ahmad Ihsan, Jusoh, Muhammad Huzaimy, Abdul Rahman, Farah Yasmin

    Published 2011
    “…Stochastic optimization algorithms are a new breed of optimizers that have recently been developed. …”
    Get full text
    Get full text
    Research Reports
  10. 10
  11. 11

    Determining malaria risk factors in Abuja, Nigeria using various statistical approaches by Segun, Oguntade Emmanuel

    Published 2018
    “…Based on cross-validation analysis, the score-based algorithm outperformed the constraint-based algorithms in the structural learning. …”
    Get full text
    Get full text
    Thesis
  12. 12

    Feature engineering techniques to classify cause of death from forensic autopsy reports / Ghulam Mujtaba by Ghulam , Mujtaba

    Published 2018
    “…These master feature vectors were fed as input to six machine learning algorithms to construct and evaluate the classification models. …”
    Get full text
    Get full text
    Get full text
    Thesis
  13. 13