Search Results - parallel computing ((path algorithm) OR (search algorithm))*

Parallel genetic algorithms for shortest path routing in high- performance computing / Mohd Erman Safawie Che Ibrahim by Che Ibrahim, Mohd Erman Safawie

Get full text
Get full text

Parallel Homologous Search With Hirschberg Algorithm: A Hybrid MPI-Pthreads Solution. by Abdul Rashid, Nur'Aini, Abdullah, Rosni, Hj. Talib, Abdullah Zawawi

Get full text
Get full text

Parallel Quick-Skip Search Hybrid Algorithm For The Exact String Matching Problem. by Naser, Mustafa Abdulsahib

Get full text
Get full text

An Experimental Study on Relationship between Performance and Energy Consumption of Serial and Parallel Text Searching Algorithm. by Isahak, Siti Zulaikha

“…How to reduce execution time in searching large amount of data? In this paper, text searching algorithm is using to study the relationship between performance of computer and amount of energy produced in serial and parallel text searching algorithm. …”
Get full text
Get full text

Solving traveling salesman problem on cluster compute nodes by I.A., Aziz, Haron, N., Mehat, M., Jung, L.T., Mustapa, A.N., Akir, E.A.P.

“…The sequential algorithm is then converted into a parallel algorithm by integrating it with the Message Passing Interface (MPI) libraries so that it can be executed on a cluster computer. …”
Get full text
Get full text

Parallel metaheuristic algorithm for route planning using CUDA by Looi, Daniel Jun Jie

“…Area of Study: Massively Parallel Computing, Combinatorial Optimization Keywords: Parallel Metaheuristic Algorithm, Travelling Salesman Problem, CUDA, GPU, Genetic Algorithm…”
Get full text
Get full text

A genetic similarity algorithm for searching the Gene Ontology terms and annotating anonymous protein sequences by M. Othman, Razib, Deris, Safaai, Md. IIlias, Rosli

“…Then, the parallel genetic algorithm is employed to perform batch retrieval and to accelerate the search in large search space of the Gene Ontology graph. …”
Get full text
Get full text
Get full text

Sequential and parallel multiple tabu search algorithm for multiobjective urban transit scheduling problems by Uvaraja, Vikneswary

“…Additionally, the MTS algorithm is also implemented in parallel computing to produce parallel MTS for generating comparable solutions in shorter computational times. …”
Get full text
Get full text

High-Speed shortest path co-processor design by Idris, Mohd Yamani Idna, Abu Bakar, Suraya, Tamil, Emran Mohd, Razak, Zaidi, Noor, Noorzaily Mohamed

“…Shortest path algorithms are significant in graph theory and have been applied in many applications such as transportation and networking. …”
Get full text
Get full text

Parallel multiple tabu search for multiobjective Urban Transit Scheduling Problem by Uvaraja, Vikneswary, Lai, Soon Lee, Abd Rahmin, Nor Aliza, Hsin, Vonn Seow

“…A set covering model was then adopted to minimize the number of buses and drivers simultaneously. A parallel tabu search algorithm was proposed to solve the problem by modifying the initialization process and incorporating intensification and diversification approaches to guide the search effectively from the different feasible domain in finding optimal solutions with lesser computational effort. …”
Get full text
Get full text

Performance Comparison of Parallel Bees Algorithm on Rosenbrock Function by Hammash, Nayif Mohammed

“…This thesis presents the parallel Bees Algorithm as a new approach for optimizing the last results for the Bees Algorithm. …”
Get full text
Get full text
Get full text

Efficient Sequential and Parallel Routing Algorithms in Optical Multistage Interconnection Network by Abduh Kaid, Monir Abdullah

Get full text
Get full text

Tool path generation of contour parallel based on ant colony optimisation by Abdullah, Haslina, Ramli, Rizauddin, Abd Wahab, Dzuraidah, Abu Qudeiri, Jaber

“…The optimisation of tool path length based on ACO algorithm ascertained that the cutting tool remove the uncut line once and able to eliminate the uncut region in the shortest tool path length. …”
Get full text
Get full text

Development of an automatics parallel parking system for nonholonomic mobile robot by Mohd Fairuz , Abdollah, Syed Najib , Syed Salim, Irma Wani , Jamaludin, Muhammad Nizam , Kamarudin

Get full text
Get full text

Local search approaches for patient scheduling problem in parallel operating theatre by Alimin, Nur Neesha

“…The objective of the study is to propose different types of local search which are local search(LS), improved local search(ILS) and mixed local search (MLS) for solving patient scheduling problem in parallel OT. …”
Get full text
Get full text

Guided genetic algorithm for solving unrelated parallel machine scheduling problem with additional resources by Abed, Munther Hameed, Mohd Nizam Mohmad, Kahar

Get full text
Get full text
Get full text

The development of semantic meta-database: an ontology based semantic integration of biological databases by Samsudin, Ruhaidah, Deris, Safaai, Othman, Muhammad Razib, Md. Illias, Rosli

“…The tool comprises two intelligent algorithms. The first algorithm combines parallel genetic algorithm with the split-and-merge algorithm. …”
Get full text
Get full text

Topology-aware hypergraph based approach to optimize scheduling of parallel applications onto distributed parallel architectures by Koohi, Sina Zangbari

“…The first step lies at the modelling of parallel applications running on heterogeneous parallel computers. …”
Get full text
Get full text

A tabu search approach for mixed-model parallel assembly line balancing problem (type II) by Esmaeilian, Gholam Reza, Sulaiman, Shamsuddin, Ismail, Napsiah, Hamedi, Maryam, Megat Ahmad, Megat Mohammad Hamdan

“…The developed methodology, tabu search mixed-model parallel assembly line balancing (TMMPALB) model, is tested on test problems producing three and four products. …”
Get full text
Get full text

Accounting Information Systems Genetic Algorithms for All-Optical Shared Fiber-Delay-Line Packet Switches by Liew, S.Y., Wong, E.S.K.

“…In the first algorithm, packet scheduling is formulated as a tree-searching problem. …”
Get full text
Get full text
Get full text