features selection method on the basis of Firefly Algorithm (FA) is suggested to improve the big data analysis. FA meta-heuristic techniques modelled on the behaviour of the fireflies solve
used by another one then there occurs a conflict. In existing the algorithm used is HAS,heuristic auditing strategy but in proposed we are following Read-after-write consistency allows
genetic algorithm is to study the convergence state of genetic algorithm. Genetic algorithm is a Mata-heuristic search technique; this technique is based on the Darwin theory of Natural Selection
framework is the core of the architecture of the framework. This algorithm is based on heuristic assumptions, which aims to produce a good estimate formula as fast as possible. Moreover
Steiner approach, Maze routing method, Top-down partitioning approach and Greedy heuristic method.Comparison of these algorithms in accordance with their speed, efficiency, resources used and other pros and cons
optimal solutions. Past two decades, much attention has been made to general heuristics such as Genetic algorithm, Ant Colony Optimization, Tabu Search and Simulated Annealing to solve this type
components defined by their respective extents of pair-wise atomic contact, thus allowing for algorithmic differentiation between varying degrees of interaction. These surface-weighted interaction fingerprints were…
this article is to develop a newly hybrid powerful meta-heuristic to be integrate the Sine Cosine Algorithm with Salp Swarm Algorithm called HSSA-SCA for the purpose of improved
discussed in detail. Di conditional Functional Dependencies and Fast FDs a heuristic-driven, Depth-first algorithm for mining FD from relation instances are elaborated. Privacy preserving publishing micro data with
complexity, for large scale networks we are developing the heuristics with polynomial time complexity and we are using token bucket algorithm to avoid packet loss while it travelling
optimization. It consists of an iterative approach combining a placement heuristic and a gradient descent-based method. The algorithm decides the total number of beams needed and provides their pointing
optimization. It consists of an iterative approach combining a placement heuristic and a gradient descent-based method. The algorithm decides the total number of beams needed and provides their pointing
based on the multiple-choice knapsack model and propose a modified ant colony optimization algorithm to solve the problem. The combination of revenue and acceptance ratio ... cost of a candidate network is defined as…
recent years, much attention is given to heuristics and search techniques. To solve this problem, we propose Differential Evolution Algorithm (DEA) and Particle Swarm Optimization (PSO) to evolve best values
Abstract Ant colony optimization algorithm (ACO) is a soft computing met heuristic that belongs to swarm intelligence methods. ACO has proven a well performance in solving certain NP-hard problems
recently developed population based heuristic optimization technique. The hybrid heuristic model involves Particle Swarm Optimization (PSO) algorithm and Simulated Annealing (SA) algorithm. The PSO/SA algorithm has been…
operation research and computer science, a genetic algorithm (GA) is a most powerful meta-heuristic approach, its inspired by the process of natural selection. This approach is usually applied ... solutions are compared…
from each data point to its nearest center. A popular heuristic for k-means clustering is Lloyd's algorithm. In this paper we have analyzed and presented some extensions that
competitive ratios of optimal online deterministic algorithms for the single VM migration and dynamic VM consolidation problems. Furthermore, we propose novel adaptive heuristics for dynamic consolidation of VMs based
four parts. The purpose is to make this algorithm fast and accurate. When we determine the initial population can use Greedy heuristic algorithmï¼Ã‚ÂŒthen do genetic manipulation to make ... cross operator and mutation…
feature vectors to provide a variational image segmentation algorithm that is performed in the feature space. We also propose a heuristic approach to automatically select the number of segments ... meanwhile maintain a…
Colony Optimization (ACO) is a Meta heuristic combinatorial optimization technique. Ant Colony System (ACS) is the algorithm in the ACO. This is based on the behavior of ants. Many ants
For authors and organisers
Publish, present and keep up with your field
Find the right journal for your paper and submit your manuscript.