Search Results - optimal ((((protocol algorithm) OR (graph algorithm))) OR (based algorithm))

Refine Results
  1. 1
  2. 2

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

    Published 1997
    “…Searching for possible abutment between the transistor pairs are modelled as a bipartite graph. A depth - first search algorithm is used to search for optimal chaining. …”
    Get full text
    Get full text
    Thesis
  3. 3

    African Buffalo Optimization (ABO): A New Metaheuristic Algorithm by Odili, Julius Beneoluchi, M. N. M., Kahar

    Published 2015
    “…The African Buffalo Optimization (A.B.0) algorithm simulates the African buffalos' behaviour by encapsulation in a mathematical model; which solves a number of discrete optimization problems using graph-based route planning, job scheduling and it extends Swarm Intelligence paradigms. …”
    Get full text
    Get full text
    Get full text
    Article
  4. 4

    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 Smith-Waterman is been simplified into four modules which were initialization, score calculation, matrix filling and optimal path. The scope of the paper based on optimal path trace back using graph theory. …”
    Get full text
    Get full text
    Article
  5. 5

    Approximate methods for minimum vertex cover fail to provide optimal results on small graph instances: A review by Fayaz, Muhammad, Arshad, Shakeel, Shah, Abdul Salam, Shah, Asadullah

    Published 2018
    “…The key contribution of this paper is the provision of small benchmark graphs on which the given approximation algorithms fail to provide optimal results. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  6. 6

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

    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 Smith-Waterman is been simplified into four modules which were initialization, score calculation, matrix filling and optimal path. The scope of the paper based on optimal path trace back using graph theory. …”
    Get full text
    Get full text
    Student Project
  8. 8

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

    Published 2012
    “…The proposed algorithm is known as the enhance ant colony optimization (EACO). …”
    Get full text
    Get full text
    Get full text
    Monograph
  9. 9

    An improved energy-efficient clustering protocol to prolong the wireless sensor network lifetime by Alhmood, Ali Abdul-Hussian Hassan

    Published 2021
    “…The simulation results prove that the IEECP prolongs the network lifetime better than Energy efficient clustering protocol based on K-means (EECPK-means)-midpoint algorithm (EECPK-means), Traffic-Aware Channel Access Algorithm (TACAA), and an optimal clustering mechanism based on Fuzzy C-means (OCM–FCM) protocols based on the First node die and Weighted first node die. …”
    Get full text
    Get full text
    Get full text
    Thesis
  10. 10

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

    Published 2012
    “…It is noted that active user intervention increases the acceleration of Genetic Algorithm towards an optimal solution. In proposed research work, the user is aided by a visualization based on the representation of multidimensional Genetic Algorithm data on 2-0 space. …”
    Get full text
    Get full text
    Thesis
  11. 11

    Low Complexity Error Correction in Low Density Parity Check (LDPC) Code Decoder and Encoder for Decode and Forward Cooperative Wireless Communication by JAM'AAH, SUUD

    Published 2021
    “…By using the optimization min-sum belief propagation approach, a low complexity min-sum (MS) based decoding algorithm called Variable Global Optimization Min-Sum (VGOMS) has been developed. …”
    Get full text
    Get full text
    Get full text
    Thesis
  12. 12

    QTCP: an optimized and improved congestion control algorithm of high-speed TCP networks by Qureshi, Barkatullah, Othman, Mohamed, K. Subramaniam, Shamala, Abdul Hamid, Nor Asilah Wati

    Published 2011
    “…To overcome these problems Quick Transport Control Protocol (QTCP) algorithm based on optimizations of HS-TCP slow start algorithm and Additive Increase and Multiplicative Decrease (AIMD) algorithm have been proposed. …”
    Get full text
    Get full text
    Conference or Workshop Item
  13. 13

    Efficient and scalable ant colony optimization based WSN routing protocol for IoT by Sharmin, Afsah, Anwar, Farhat, Motakabber, S. M. A.

    Published 2020
    “…For this reason, many intelligent systems have been utilized to design routing algorithms to handle the network's dynamic state. In this paper, an ant colony optimization (ACO) based WSN routing algorithm for IoT has been proposed and analyzed to enhance scalability, to accommodate node mobility and to minimize initialization delay for time critical applications in the context of IoT to find the optimal path of data transmission, improvising efficient IoT communications. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  14. 14

    Variable Global Optimization min-sum (VGOMS) algorithm of decode-and forward-protocol for the relay node in the cooperative channel by Hushairi, Zen, Al-Khalid, Hj Othman, Khairuddin, Abdul Hamid, Jamaah, Suut

    Published 2020
    “…A low complexity min-sum (MS) based algorithm called the Variable Global Optimization min-sum (VGOMS) algorithm has been developed to minimise the error corrective performance. …”
    Get full text
    Get full text
    Get full text
    Article
  15. 15

    A comparative study of greedy algorithms and dynamic programming in road network / Nuralya Sofea Hairulanuar by Hairulanuar, Nuralya Sofea

    Published 2024
    “…The Bellman Ford algorithm is notable for its capability to manage graphs with negative weights, however it is less efficient than Dijkstra's algorithm for graphs with non-negative weights. …”
    Get full text
    Get full text
    Thesis
  16. 16

    Variable Global Optimization min-sum (VGOMS) algorithm of decodeand-forward protocol for the relay node in the cooperative channel by Hushairi, Zen, Jamaah, Suut, Al-Khalid, Bin Hj Othman, Khairuddin, Bin Ab Hamid

    Published 2019
    “…A low complexity min-sum (MS) based algorithm called the Variable Global Optimization min-sum (VGOMS) algorithm has been developed to minimise the error corrective performance. …”
    Get full text
    Get full text
    Get full text
    Article
  17. 17

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

    Published 2012
    “…In addition, a graph algorithm based on greedy methods is employed to compute a new set of optimal weighted electronic properties of the fullerenes via computing their Minimum Weight Spanning Trees (MWSTs). …”
    Get full text
    Get full text
    Thesis
  18. 18
  19. 19

    An online density-based clustering algorithm for data stream based on local optimal radius and cluster pruning by Islam, Md Kamrul

    Published 2019
    “…In this study, a fully online density-based clustering algorithm called Buffer-based Online Clustering for Evolving Data Stream (BOCEDS) is presented. …”
    Get full text
    Get full text
    Thesis
  20. 20