Search Results - (((( optimal graph algorithm ) OR ( optimal search algorithm ))) OR ( optical code algorithm ))

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. …”
Get full text
Get full text

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

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

“…This paper proposes a new meta-heuristic approach to solving numerical and graph-based problems. The African buffalo algorithm evolved from an understanding of the animal's survival instincts and the search techniques they utilize in the African forests and savannahs; the search for the optimal path to pasture is aligned to their cooperative, intelligent, and social nature. …”
Get full text
Get full text
Get full text

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

Get full text
Get full text

Enhancing three variants of harmony search algorithm for continuous optimization problems by Alomoush, Alaa A., Alsewari, Abdulrahman A., Kamal Z., Zamli, Alrosan, Ayat, Alomoush, Waleed, Alissa, Khalid

“…Meta-heuristic algorithms are well-known optimization methods, for solving real-world optimization problems. …”
Get full text
Get full text
Get full text

Guidance system based on Dijkstra-ant colony algorithm with binary search tree for indoor parking system by Mohammad Ata, Karimeh Ibrahim, Che Soh, Azura, Ishak, Asnor Juraiza, Jaafar, Haslina

“…This solution depending on applying the optimization on an optimal path while the traditional ACO is optimizing the random path based on the greedy algorithm hence we get the most optimal path. …”
Get full text
Get full text
Get full text

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

“…Visualization techniques help in understanding the searching behaviour of Genetic Algorithm. lt also makes possible the user interactions during the searching process. …”
Get full text
Get full text

A Hybrid ACO-Graph Entropy for Functional Modules Detection From Protein-Protein Interaction Network by Jamaludin, Sallim, Rozlina, Mohamed, Che, Yahaya, Roslina, Abdul Hamid

“…The Ant Colony Optimization (ACO) Algorithm has been adapted for the protein functional module detection by modeling the problem as an optimization problem. …”
Get full text
Get full text
Get full text

Power system network splitting and load frequency control optimization using ABC based algorithms / Kanendra Naidu a/l Vijyakumar by Vijyakumar, Kanendra Naidu

“…This research presents a modified optimization program for the system splitting problem in large scale power system based on Artificial Bee Colony algorithm and graph theory. …”
Get full text
Get full text

A Modified ACO-based Search Algorithm for Detecting Protein Functional Module From Protein Interaction Network by Jamaludin, Sallim, Rozlina, Mohamed, Roslina, Abd Hamid

“…The Ant Colony Optimization (ACO) Algorithm has been adapted for the protein functional module detection by modeling the problem as an optimization problem. …”
Get full text
Get full text
Get full text

Combinatorial test suites generation strategy utilizing the whale optimization algorithm by Ali Abdullah, Hassan, Salwani, Abdullah, Kamal Zuhairi, Zamli, Rozilawati, Razali

“…In the last 15 years, applications of meta-heuristics as the backbone of t-way test suite generation have shown promising results (e.g. Particle Swarm Optimization, Cuckoo Search, Flower Pollination Algorithm, and Hyper-Heuristics (HHH), to name a few). …”
Get full text
Get full text
Get full text

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

“…Stochastic-type algorithms have shown good performance in locating the global optima in optimization problems, even in difficult search spaces [1). …”
Get full text
Get full text

Sequence t-way test generation using the barnacles mating optimizer algorithm by Kamal Z., Zamli, Kader, Md. Abdul

“…More precisely, we focus on the generation of test cases due to the ordering of inputs (or sequence) using the newly developed Barnacles Mating Optimizer (BMO) Algorithm. Our experience with BSS is encouraging as we manage to match some of existing best test suite size for small interaction strength (t<5) with small number of event sequences (≤10). …”
Get full text
Get full text
Get full text
Get full text

A genetic algorithm to minimise the maximum lateness on a single machine family scheduling problem by Lee, Lai Soon, Nazif, Habibeh

“…The OCGA is compared with other well known local search method namely dynamic length tabu search, randomised steepest descent method, and other variants of genetic algorithms using extensive data sets collected from the literatures. …”
Get full text

Test case minimization applying firefly algorithm by Hashim, Nor Laily, Dawood, Yasir Salman

“…The proposed test case minimization method has the following steps: provide weight to the paths, calculate path coverage for each path, transform an immediate graph into an adjacency matrix, which later is used to apply firefly algorithm and generate optimal test cases. …”
Get full text
Get full text
Get full text

Recent research in cooperative path planning algorithms for multi-agent using mixed- integer linear programming by Che Ku, Nor Azie Hailma, Omar, Rosli, Sabudin Elia Nadira, Sabudin Elia Nadira

“…This paper will review and compare the performances of those existing methods that can find solution without graph search algorithm such as Mixed-Integer Linear Programming (MILP) techniques which exactly solves the problem and then propose four alternative MILP formulations which are computationally less intensive and suited for real-time purposes, but yield a theoretically guaranteed suboptimal solution.…”
Get full text
Get full text

Automated Examination Timetabling System (AETSys) / Ariff Md Ab Malik by Md Ab Malik, Ariff, Haruddin, Hanitahaiza, Alwi, Anisah, Mohamed, Khainizam

“…This system has been developed based on a hybridization of local search-population based metaheuristic algorithms. …”
Get full text
Get full text

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

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

Novel Adaptive Bacterial Foraging Algorithms for Global Optimisation with Application to Modelling of a TRS by Ahmad Nor Kasruddin, Nasir, Nor Maniha, Abd Ghani, Tokhi, M. O.

“…The constant step size in the original bacterial foraging algorithm causes oscillation in the convergence graph where bacteria are not able to reach the optimum location with large step size, hence reducing the accuracy of the final solution. …”
Get full text
Get full text

Integrated optimization of mixed-model assembly sequence planning and line balancing using multi-objective discrete particle swarm optimization by M. F. F., Ab Rashid, Tiwari, Ashutosh, Hutabarat, Windo

“…Besides that, MODPSO coefficient tuning was also conducted to identify the best setting so as to optimize the problem. The results from this experiment indicated that the MODPSO algorithm presents a significant improvement in term of solution quality toward Pareto optimal and demonstrates the ability to explore the extreme solutions in the mixed-model assembly optimization search space. …”
Get full text
Get full text
Get full text