Search Results - optimal ((_ algorithm) OR (((((protocol algorithm) OR (graph algorithm))) OR (cpdod algorithm))))

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

Subjects: “…Ant colony optimization…”

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

“…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

Optimizing boarding school schedule using graph colouring : case study of Sekolah Menengah Sultan Abdul Halim / Nur Farhana Mohd Asri by Mohd Asri, Nur Farhana

“…The result has shown that the Greedy Algorithm has succeeded to produce the lowest minimal color compared to Graph Coloring Algorithm. …”
Get full text
Get full text

Optimizing boarding school schedule using graph coloring: case study of Sekolah Menengah Sultan Abdul Halim / Nur Farhana Mohd Asri by Mohd Asri, Nur Farhana

“…The result has shown that the Greedy Algorithm has succeeded to produce the lowest minimal color compared to Graph Coloring Algorithm. …”
Get full text
Get full text

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

“…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

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

“…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

A comparative analysis of Prim, Kruskal, and Reverse-Delete algorithms in optimizing routes within Terengganu’s and Pahang’s attraction road network / Munashahira Mohammad Zahid by Mohammad Zahid, Munashahira

“…The Reverse-Delete algorithm works in reverse; it starts with the full graph and iteratively removes the largest edges, ensuring that the graph remains connected. …”
Get full text
Get full text

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

“…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

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

“…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

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

“…In this study, a straightforward Particle Swarm Optimization approach was used to determine the optimal scaling factor to obtain optimized error corrective performance of the algorithm. …”
Get full text
Get full text
Get full text

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

“…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

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

“…In this study, a straightforward Particle Swarm Optimization approach was used to determine the optimal scaling factor to obtain optimized error corrective performance of the algorithm. …”
Get full text
Get full text
Get full text

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

“…This algorithm only applies the optimization scaling factor at the bit node processing of the variable node operation. …”
Get full text
Get full text
Get full text

UNDERWATER ACOUSTIC COMMUNICATIONS: DATA PACKET SIZE OPTIMIZATION WITH PERFORMANCE METRICS OF THROUGHPUT EFFICIENCY AND ENERGY EFFICIENCY QUALIFIED UNDER DIFFERENT BIT-ERROR-RATE by LOW , TANG JUNG

“…These databases are to be indexed by the proposed algorithm as a look-up graph (or as look-up table) to determine the optimal data packet size for effective and efficient data transmission in the UWA channel. …”
Get full text
Get full text
Get full text
Get full text
Get full text
Get full text
Get full text
Get full text
Get full text
Get full text
Get full text
Get full text

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

“…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

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

“…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

Path Optimization For Cooperative Multi-Head 3d Printing by Cheong, Kah Jun

“…Two well-known algorithms for solving a closely related graph theory problem known as the Travelling Salesman Problem (TSP) are the Ant System (AS) and Ant Colony System (ACS) algorithms. …”
Get full text
Get full text

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

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

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

“…Hence, these approaches regularly fail to provide optimal results on specific graph instances. These problems motivated to propose Max Degres Around (MDA) approximation algorithm for the MVC problem. …”
Get full text
Get full text
Get full text

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

“…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