Search Results - (( intelligence based gene algorithm ) OR ( intelligence based generic algorithm ))

Incorporating semantic similarity measure in genetic algorithm: an approach for searching the gene ontology terms by M. Othman, Razib, Deris, Safaai, M. Ilias, Rosli, Alashwal, Hany Taher Ahmed, Hassan, Rohayanti, Mohamed, Farhan

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

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

“…The aim of the proposed approach is to study the benefit of using visualization techniques to explorer Genetic Algorithm data based on gene values. The user participates in the search by proposing a new individual. …”
Get full text
Get full text

Long-term electrical energy consumption: Formulating and forecasting via optimized gene expression programming / Seyed Hamidreza Aghay Kaboli by Seyed Hamidreza , Aghay Kaboli

“…Then, in order to cope with the limitations of the existing artificial intelligence (AI) based methods, optimized gene expression programming (GEP) is applied to precisely formulate the relationships between historical data and EEC of ASEAN-5 countries. …”
Get full text
Get full text
Get full text

Exploring the High Performance Computing-Enablement of a Suite of Gene-Knockout Based Genetic Engineering Applications by Li, Zhenya, Sinnott, Richard O., Choon, Yee Wen, Sjaugi, Muhammad Farhan, Mohd Saberi, Mohamad, Safaai, Deris, Suhaimi, Napis, Omatu, Sigeru, Corchado, Juan Manuel, Zuwairie, Ibrahim, Zulkifli, Md. Yusof

Get full text
Get full text
Get full text

Optic cup and optic disc segmentation using improved selfish gene algorithm / Norharyati Md Ariff by Md Ariff, Norharyati

“…This study performed using a new bio-inspired algorithm; Selfish Gene Algorithm (SFGA) for optic cup and optic disc segmentation. …”
Get full text
Get full text

An Evaluation of Machine Learning Algorithms for Missing Values Imputation by Kohbalan, Moorthy, Ali, Mohammed Hasan, Mohd Arfian, Ismail, Chan, Weng Howe, Mohd Saberi, Mohamad, Safaai, Deris

Get full text
Get full text
Get full text

Adapting robot kinematics for human-arm motion recognition by Chan, C.S., Liu, H., Brown, D.

Get full text
Get full text

A hybrid of ant colony optimization, genetic algorithm and flux balance analysis for optimization of succinic acid production in Escherichia coli by Tan, Jun Bin, Choon, Yee Wen, Moorthy, Kohbalan, Hasyiya Karimah, Adli, Muhammad Akmal, Remli, Mohd Arfian, Ismail, Zuwairie, Ibrahim, Mohd Saberi, Mohamad

“…Ant colony optimization (ACO) is a swarm intelligent optimization that is inspired based on the natural foraging behavior of ant colony. …”
Get full text
Get full text
Get full text

A technical perspective on integrating artificial intelligence to solid‑state welding by Yaknesh, Sambath, Rajamurugu, Natarajan, Babu, Prakash K., Subramaniyan, Saravanakumar, Khan, Sher Afghan, Saleel, C. Ahamed, Alam, Mohammad Nur‑E, Soudagar, Manzoore Elahi Mohammad

“…Studies on Diffusion Bonding reveal that ANN and Generic Algorithms can predict outcomes with an accuracy range of 85 – 99%, while Response Surface Methodology such as Optimization Strategy can achieve up to 95 percent confidence levels in improving bonding strength and optimizing process parameters. …”
Get full text
Get full text
Get full text
Get full text

A technical perspective on integrating artificial intelligence to solid‑state welding by Yaknesh, Sambath, Rajamurugu, Natarajan, Babu, Prakash K., Subramaniyan, Saravanakumar, Khan, Sher Afghan, Saleel, C. Ahamed, Nur‑E‑Alam, Mohammad, Soudagar, Manzoore Elahi Mohammad

“…Studies on Diffusion Bonding reveal that ANN and Generic Algorithms can predict outcomes with an accuracy range of 85 – 99%, while Response Surface Methodology such as Optimization Strategy can achieve up to 95 percent confidence levels in improving bonding strength and optimizing process parameters. …”
Get full text
Get full text
Get full text
Get full text
Get full text
Get full text

Industry 4.0 With Intelligent Manufacturing 5G Mobile Robot Based On Genetic Algorithm by Anwar Apandi, Nur Ilyana, Hawari, Mohd Zarifitri Kasim

Get full text
Get full text
Get full text
Get full text

Speech emotion verification system (SEVS) based on MFCC for real time applications by Kamaruddin, Norhaslinda, Abdul Rahman, Abdul Wahab

Get full text
Get full text
Get full text

An artificial immune system model as talent performance predictor / Siti ‘Aisyah Sa’dan, Hamidah Jantan and Mohd Hanapi Abdul Latif by Sa’dan, Siti ‘Aisyah, Jantan, Hamidah, Abdul Latif, Mohd Hanapi

Get full text
Get full text

Enhancing Harmony Search Parameters Based On Step And Linear Function For Bus Driver Scheduling And Rostering Problems by Mansor, Nur Farraliza

“…Optimization is a major challenge in numerous practical world problems.According to the “No Free Lunch (NFL)” theorem,there is no existing single optimizer algorithm that is able to resolve all issues in an effective and efficient manner.It is varied and need to be solved according to the specific capabilities inherent to certain algorithms making it hard to foresee the algorithm that is best suited for each problem.As a result,the heuristic technique is adopted for this research as it has been identified as a potentially suitable algorithm.Alternative heuristic algorithms are also suggested to obtain optimal solutions with reasonable computational effort.However,the heuristic approach failed to produce a solution that nears optimum when the complexity of a problem increases;therefore a type of nature-inspired algorithm known as meta-euristics which utilises an intelligent searching mechanism over a population is considered and consequently used.The meta-heuristic approach is widely used to substitute heuristic terms and is broadly applied to address problems with regards to driver scheduling.However,this meta-heuristic technique is still unable to address the fairness issue in the scheduling and rostering problems.Hence,this research proposes a strategy to adopt an amendment of the harmony search algorithm in order to address the fairness issue which in turn will escalate the level of fairness in driver scheduling and rostering.The harmony search algorithm is classified as a meta-heuristics algorithm that is capable of solving hard and combinatorial or discrete optimisation problems.In this respect,the three main operators in harmony search,namely the Harmony Memory Consideration Rate (HMCR),Pitch Adjustment Rate (PAR) and Bandwidth (BW) play a vital role in balancing local exploitation and global exploration.These parameters influence the overall performance of the HS algorithm,and therefore it is crucial to fine-tune them. …”
Get full text
Get full text
Get full text
Get full text

Process Planning Optimization In Reconfigurable Manufacturing Systems by Musharavati, Farayi

“…The five (5) AADTs include; a variant of the simulated annealing algorithm that implements heuristic knowledge at critical decision points, two (2) cooperative search schemes based on a “loose hybridization” of the Boltzmann Machine algorithm with (i) simulated annealing, and (ii) genetic algorithm search techniques, and two (2) modified genetic algorithms. …”
Get full text
Get full text

Overview of biomedical relations extraction using hybrid rule-based approaches. by Abdul Kadir, Rabiah, Bokharaeian, Behrouz

Get full text
Get full text
Get full text

Deriving the absorption coefficients of lattice mismatched InGaAs using genetic algorithm by Lee H.J., Ali Gamel M.M., Ker P.J., Jamaludin M.Z., Wong Y.H., Yap K.S., Willmott J.R., Hobbs M.J., David J.P.R., Tan C.H.

“…By selecting the best gene for the next iteration, the utilization of Genetic Algorithm has significantly reduced the number of iterations from a maximum of 10 000 to 300. …”