Search Results - optimal ((((((graph algorithm) OR (drops algorithm))) OR (mining algorithm))) OR (based algorithm))

An online density-based clustering algorithm for data stream based on local optimal radius and cluster pruning by Islam, Md Kamrul

“…In this study, a fully online density-based clustering algorithm called Buffer-based Online Clustering for Evolving Data Stream (BOCEDS) is presented. …”
Get full text
Get full text

Benchmark simulator with dynamic environment for job scheduling in grid computing by Ku-Mahamud, Ku Ruhana

“…Characteristics of jobs and resources to be used in evaluating the performance of the scheduling algorithm must reflect the dynamic nature of real grid environment.Static models of jobs and resources cannot be used to generate jobs and resources in simulating the grid environment because of the dynamic nature of the grid.This paper presents a new graph representation of jobs and resources which is practical for hybrid metaheuristic model implementation such as ant colony optimization and genetic algorithm.A dynamic model that can generate jobs and resources similar to the jobs and resources in the real grid environment is also proposed.Jobs and resources may join in or drop out from the grid.Stochastic analysis is performed on the characteristics of jobs and resources.A simulator based on the dynamic expected time to compute, has been developed and can be used as a benchmark.The simulator can generate jobs and resources with the characteristics of jobs and resources in the real grid environment.This will facilitates the evaluation of dynamic job scheduling algorithm.…”
Get full text
Get full text
Get full text

Dissimilarity algorithm on conceptual graphs to mine text outliers by Kamaruddin, Siti Sakira, Hamdan, Abdul Razak, Abu Bakar, Azuraliza, Mat Nor, Fauzias

Get full text
Get full text
Get full text

Analysis and modeling of database storage optimization power consumption usage for green data centers by Wan Noor Hamiza, Wan Ali

“…The proxies can be discovered by using a developed algorithm of functional dependencies (FDs) called as TANE algorithm. …”
Get full text
Get full text
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.

Using graph algorithm and classification technique for finding an optimal bus route in time-dependent travel times by Deelertmongkolchai, Satjayod, Chumwatana, Todsanai, Thaiupathump, Choonhapong

“…However, they are suffering from the long hours in traffic jam especially in rush hour.They also cannot avoid this such jam as bus routes are fixed by Bangkok Mass Transit Authority (BMTA).This paper aims to propose a technique for finding an Optimal Bus Route in Time-Dependent Travel Times by using graph algorithm and data mining technique. …”
Get full text
Get full text
Get full text

Solving university examination timetabling problem using intelligent water drops algorithm by Aldeeb B.A., Norwawi N.M., Al-Betar M.A., Jali M.Z.B.

Subjects: “…Intelligent water drops algorithm…”

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

“…Searching for possible abutment between the transistor pairs are modelled as a bipartite graph. A depth - first search algorithm is used to search for optimal chaining. …”
Get full text
Get full text

An enhanced sequential exception technique for semantic-based text anomaly detection by Taiye, Mohammed Ahmed

“…ESET performs text anomaly detection by employing optimized Cosine Similarity, hybridizing LSA with modified SET, and integrating it with Word Sense Disambiguation algorithms specifically Lesk and Selectional Preference. …”
Get full text
Get full text
Get full text

Role Minimization As An Optimization Metric In Role Mining Algorithms : A Literature Review by Ahmad, Rabiah, Abd Hamid, Nazirah, Selamat, Siti Rahayu

“…A recent access control model that could accommodate a dynamic structure such as cloud computing can be recognized as role based access control and the role management process of this access control can be identified as role mining.The current trend in role based access control is the role mining problem that can be described as the difficulty to uncover an optimum set of roles from the userpermission assignment.To solve this problem,the researchers have proposed role mining algorithms to produce role set and among the existing algorithms there is an intrinsic topic of the common perception to evaluate the goodness of the generated role set.Eventually,the value of the identified roles could be measured by the preferred metric of optimality namely the number of roles,sizes of userassignment and permission-assignment and Weighted Structural Complexity.Until now, there is some disagreement on the optimization metric but notably many researchers have agreed on the minimization of the number of roles as a solid metric.This paper discusses an overview of the current state-of-the-art on the recent role mining algorithms that focus on role minimization as an optimization metric to evaluate the goodness of the identified roles. …”
Get full text
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

Intelligent Examination Timetabling System Using Hybrid Intelligent Water Drops Algorithm by AlDeeb, BA, Norwawi, NM, Al-Betar, MA, Jali, MZ

Subjects:

Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator: article by Othman, Nor Shuhaida

“…The Smith-Waterman is been simplified into four modules which were initialization, score calculation, matrix filling and optimal path. The scope of the paper based on optimal path trace back using graph theory. …”
Get full text
Get full text

Approximate methods for minimum vertex cover fail to provide optimal results on small graph instances: A review by Fayaz, Muhammad, Arshad, Shakeel, Shah, Abdul Salam, Shah, Asadullah

“…The key contribution of this paper is the provision of small benchmark graphs on which the given approximation algorithms fail to provide optimal results. …”
Get full text
Get full text
Get full text
Get full text

Tree-based contrast subspace mining method by Florence Sia Fui Sze

“…Hence, this thesis presents the optimization of parameters values for the tree-based method by genetic algorithm. …”
Get full text
Get full text
Get full text

Modified And Ensemble Intelligent Water Drop Algorithms And Their Applications by O. F. Alijla, Basem

“…The Intelligent Water Drop (IWD) algorithm is a swarm-based model that is useful for undertaking optimization problems. …”
Get full text
Get full text

Multi-objective Binary Clonal Selection Algorithm In The Retrieval Phase Of Discrete Hopfield Neural Network With Weighted Systematic Satisfiability by Romli, Nurul Atiqah

“…The proposed algorithm in the retrieval phase showed optimal performance as compared to the baseline algorithms. …”
Get full text
Get full text

Graph-Based Algorithm With Self-Weighted And Adaptive Neighbours Learning For Multi-View Clustering by He, Yanfang

“…To address this issue, this study incorporated joint graph learning from the gmc algorithm into swmcan, creating a new algorithm called swmcan-jg. …”
Get full text
Get full text

Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator by Othman, Nor Shuhaida

“…The Smith-Waterman is been simplified into four modules which were initialization, score calculation, matrix filling and optimal path. The scope of the paper based on optimal path trace back using graph theory. …”
Get full text
Get full text

Ant colony optimization algorithm for load balancing in grid computing by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

“…The proposed algorithm is known as the enhance ant colony optimization (EACO). …”
Get full text
Get full text
Get full text