Search Results - (( intelligence fail search algorithm ) OR ( intelligence based graph algorithm ))

Solving a backtracking intelligently : a case study / Muthukkaruppan Annamalai by Annamalai, Muthukkaruppan

Get full text
Get full text

Solving the minimum dominating set problem of partitioned graphs using a hybrid bat algorithm by Abed, S.A., Rais, H.M.

“…This paper investigates the swarm intelligence behaviour represented by a population-based approach called the bat algorithm (BA) to find the smallest set of nodes that dominate the graph. …”
Get full text
Get full text

Modeling of static and dynamic components of bio-nanorobotic systems by Gavgani, Hamidreza Khataee

“…Then, these graph-based structural models of the fullerenes and graph algorithms based on dynamic programming are applied to compute a new set of optimal weighted physical properties of the components including Wiener, hyper-Wiener, Harary and reciprocal Wiener indices as well as Hosoya and hyper-Hosoya polynomials. …”
Get full text
Get full text

The application of suitable sports games for junior high school students based on deep learning and artificial intelligence by Ji, Xueyan, Samsudin, Shamsulariffin, Hassan, Muhammad Zarif, Farizan, Noor Hamzani, Yuan, Yubin, Chen, Wang

“…This study intends to develop a Spatial Temporal-Graph Convolutional Network (ST-GCN) action detection algorithm based on the MediaPipe framework. …”
Get full text
Get full text
Get full text

Hybrid bat algorithm for minimum dominating set problem by Abed, S.A., Rais, H.M.

“…In this paper, the stochastic search represented by hybrid swarm intelligence algorithm to find the smallest set of nodes that dominate the graph. …”
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

Chaos search in fourire amplitude sensitivity test by Koda, Masato

“…Work in Artificial Intelligence (AI) often involves search algorithms. In many complicated problems, however, local search algorithms may fail to converge into global optimization and global search procedures are needed. …”
Get full text
Get full text
Get full text

Chaos Search in Fourier Amplitude Sensitivity Test by Koda, Masato

“…Work in Artificial Intelligence (AI) often involves search algorithms. In many complicated problems, however, local search algorithms may fail to converge into global optimization and global search procedures are needed. …”
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

“…The Genetic Algorithm is an area in the field of Artificial Intelligence that is founded on the principles of biological evolution. …”
Get full text
Get full text

Heuristic factors in ant system algorithm for course timetabling problem by Djamarus, Djasli, Ku-Mahamud, Ku Ruhana

Get full text
Get full text

Attack graph construction for enhancing intrusion prediction based on vulnerabilities metrics by Al-Araji, Zaid Jasim Mohammed

“…For this issue, this study proposes using intelligent agents to reduce the reachability time in calculating between the nodes and use the naïve approach prune algorithm to remove unnecessary edges, minimizing the attack graph's complexity. …”
Get full text
Get full text
Get full text
Get full text

Enhanced Community Detection Based On Cross Time For Higher Visibility In Supply Chain: A Six-Steps Model Framework by Abal Abas, Zuraida, Mohd Zaki, Nurul Hafizah, Asmai, Siti Azirah, Abdul Rahman, Ahmad Fadzli Nizam, Zainal Abidin, Zaheera

Get full text
Get full text
Get full text

Deviation detection in text using conceptual graph interchange format and error tolerance dissimilarity function by Kamaruddin, Siti Sakira, Hamdan, Abdul Razak, Abu Bakar, Azuraliza, Mat Nor, Fauzias

Get full text
Get full text
Get full text

Computational comparison of major proposed methods for graph partitioning problem by Rais, H.M., Abed, S.A., Watada, J.

Get full text
Get full text

A hybrid local search algorithm for minimum dominating set problems by Abed, S.A., Rais, H.M., Watada, J., Sabar, N.R.

Get full text
Get full text

A hybrid local search algorithm for minimum dominating set problems by Abed, S.A., Rais, H.M., Watada, J., Sabar, N.R.

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

Graph theory-based radial load flow analysis to solve the dynamic network reconfiguration problem by Aman, M.M., Jasmon, G.B., Bakar, Ab Halim Abu, Mokhlis, Hazlie, Naidu, K.

“…This paper has presented an intelligent graph theory-based RLF analysis to solve "dynamic" problems. …”
Get full text
Get full text

Intelligent technique for grading tropical fruit using magnetic resonance imaging by A. Balogun, Wasiu, Salami, Momoh Jimoh Emiyoka, J. McCarthy, Michael, Mohd Mustafah, Yasir, Aibinu, Abiodun Musa

“…Our purpose, in this study, is to develop a non-destructive method to predict the status of orange fruits, based on internal quality. Graph of histogram showing the levels of different four colour intensities were acquired and analysed. …”
Get full text
Get full text
Get full text

Agarwood oil grade clustering of aquilaria malaccensis species using Extraction by GC-MS analysis: Efficient KNN algorithm based on patterns visualization of two-dimensional graph by Siti Mariatul Hazwa, Mohd Huzir, Anis Hazirah ‘Izzati H., Al-Hadi, Amir Hussairi, Zaidi, Nurlaila F., Ismail, Zakiah, Mohd Yusoff, Saiful Nizam, Tajuddin, Mohd Nasir, Taib

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