Search Results - (( java implication based algorithm ) OR ( using branch using algorithm ))

Development of low power viterbi decoder on complex programmable logic device platform by Abu, Mohd Azlan

“…For ACS, the traditional method of Viterbi algorithm is to add the previous state metric with the current branch metric, compare the new branch metric and select the minimum branch metric. …”
Get full text
Get full text
Get full text

Minimization of Test Cases and Fault Detection Effectiveness Improvement through Modified Reduction with Selective Redundancy Algorithm by Nikfal, Shima

“…To achieve such goal, this research modifies and improves the Reduction with Selective Redundancy (RSR) algorithm. In the modify algorithm, test cases would be selected according to the branch coverage if they covered different branch combination. …”
Get full text
Get full text

Solving Sudoku puzzles in Binary Integer Linear Programming using Branch and Bound algorithm / Ahida Waliyyah Ahmad Fuad by Ahmad Fuad, Ahida Waliyyah

“…This study explores the application of a Binary Integer Linear Programming (BILP) model combined with the Branch and Bound (B&B) algorithm to solve Sudoku puzzles. …”
Get full text
Get full text

Branch and bound algorithm for finding the maximum clique problem by Suyudi, M., Sukono, ., Mamat, M., Bon, A.T.

“…We present a branch and bound algorithm for the maximum clique problem in arbitrary graphs. …”
Get full text
Get full text

Hybrid artificial bee colony algorithm with branch and bound for two–sided assembly line balancing by Elteriki, Salem Abdulsalam

“…Recently, the artificial bee colony (ABC) algorithm was used in the solution process where it was considered as a very useful, effective and well-known algorithm. …”
Get full text
Get full text
Get full text
Get full text

A branch and bound and simulated annealing approach for job shop scheduling by Tan, Hui Woon, Salim, Sutinah

“…The objective is to schedule the jobs on the machines so that the total completion time is minimized. In the branch and bound approach, the job shop scheduling problem is represented by a disjunctive graph, then the optimal schedule is obtained using the branch and bound algorithm while simulated annealing is a local search based algorithm which will slightly perturb the initial feasible solution to decrease the makespan. …”
Get full text
Get full text

Loss reduction in distribution networks using new network reconfiguration algorithm by Kashem, M.A., Moghavvemi, M., Mohamed, A., Jasmon, G.B.

“…Therefore, the solution algorithm of the proposed method can identify the most effective branch exchange operations for loss reduction, with a minimum computational efforts. …”
Get full text

Comparison between alpha beta pruning algorithm and greedy algorithm in designing winning strategies in the game of checkers / Christy Jr Tan by Jr Tan, Christy

“…The algorithm is useful in some of the game search available today. …”
Get full text
Get full text

Hybrid multilayered perceptron network for classification of bundle branch blocks by Megat Syahirul Amin, Megat Ali, Ahmad Nasrul, Norali, Aisyah Hartini, Jahidin

Get full text

Design and analysis of DNA fragment assembly's converter and checker modules using De Bruijin Graph / Mohd Shafiq Mohd Helmi by Mohd Helmi, Mohd Shafiq

“…The algorithm used to construct the module is Bruijn Graph. …”
Get full text
Get full text

Design and analysis of DNA fragment assembly's converter and checker modules using De Bruijin Graph : article / Mohd Shafiq Mohd Helmi by Mohd Helmi, Mohd Shafiq

“…The algorithm used to construct the module is Bruijn Graph. …”
Get full text
Get full text

Estimation-based Metaheuristics: A New Branch of Computational Intelligence by Nor Hidayati, Abd Aziz, Zuwairie, Ibrahim, Saifudin, Razali, Nor Azlina, Ab. Aziz

“…Besides biology, physics and chemistry, state estimation algorithm also has become a source of inspiration for developing metaheuristic algorithms. …”
Get full text
Get full text

Single and Multiple variables control using Tree Physiology Optimization by Halim, A.H., Ismail, I.

“…The proposed algorithm is also compared with deterministic gradient-free algorithm: Nelder-Mead simplex (NMS) and another metaheuristic algorithm: Particle Swarm Optimization (PSO). …”
Get full text
Get full text

The implications for ahybrid detection technique against malicious sqlattacks on web applications by Bahjat Arif, Sarajaldeen Akram, Wani, Sharyar

Get full text
Get full text
Get full text

Utilizing Classifier Algorithms to Analyze Lending Activity at The Sumsel Babel Bank's Pagar Alam Branch by Muhammad, Ichsan, Tri Basuki, Kurniawan

“…In this research, a classifier algorithm was applied to create a prediction model to predict the customer before the lending application was used and process to pass the lending process in Bank Sumsel, branch Pagar Alam. …”
Get full text
Get full text
Get full text

PLANNING OF MULTIPLE FEEDERS ELECTRICAL DISTRIBUTION SYSTEM by NORDIN, AHMAD SOLLEHIN

“…In this project, several algorithms are implemented to design an electrical distribution system which are (1) Optimal Feeder Path Algorithm, (2) Modified Load Flow Algorithm, (3) Optimal Branch Conductor Selection Algorithm, and ( 4) Optimal Location of Substation Algorithm. …”
Get full text
Get full text

Solving traveling salesman problems using branch and bound methods by Mustafa, Mamat, Suyudi, M., Sukono, ., Bon, A.T.

“…Therefore, in this study we will examine the search for solving TSP problem using branch and bound methods.…”
Get full text
Get full text

Transport route optimization using genetic algorithm by Kho, Evie Siaw Hei.

“…This project is to develop an interface to assist in solving Travelling Salesman Problem, to produce an optimized route given a number of destinations. Genetic Algorithm, a branch in artificial intelligence, applies the concept of selection, crossover and mutation in genetic discipline, is used as the backend engine in this program to optimize a given route.…”
Get full text
Get full text

An efficient model for indoor radio signal prediction and coverage estimation / Md. Sumon Sarker by Md. Sumon, Sarker

“…BFS is used to generate the search space tree and Branch-And- Bound terminology is to avoid the unnecessary generation of the sub-tree using proposed bounding functions. …”
Get full text
Get full text

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

“…A depth - first search algorithm is used to search for optimal chaining. Theorems on number of branches needed to be explored at each node of search tree are derived. …”
Get full text
Get full text