Search Results - (( knowledge evaluation search algorithm ) OR ( java simulation optimization algorithm ))
Search alternatives:
- knowledge evaluation »
- evaluation search »
- java simulation »
-
1
Attribute reduction based scheduling algorithm with enhanced hybrid genetic algorithm and particle swarm optimization for optimal device selection
Published 2022“…The simulation is implemented with iFogSim and java programming language. …”
Get full text
Get full text
Article -
2
Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing
Published 2011“…Global pheromone update is performed after the completion of processing the jobs in order to reduce the pheromone value of resources. A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against existing grid resource management algorithms such as Antz algorithm, Particle Swarm Optimization algorithm, Space Shared algorithm and Time Shared algorithm, in terms of processing time and resource utilization. …”
Get full text
Get full text
Get full text
Thesis -
3
Ant colony optimization algorithm for load balancing in grid computing
Published 2012“…The proposed algorithm is known as the enhance ant colony optimization (EACO). …”
Get full text
Get full text
Get full text
Monograph -
4
A new multiple ant colonies optimization algorithm utilizing average pheromone evaluation mechanism
Published 2008Get full text
Get full text
Get full text
Conference or Workshop Item -
5
OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT
Published 2023“…To achieve this, we propose a new noble mechanism called Optimized Min-Min (OMin-Min) algorithm, inspired by the Min-Min algorithm. …”
Review -
6
Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization
Published 2019“…This study proposes a car parking management system which applies Dijkstra’s algorithm, Ant Colony Optimization (ACO) and Binary Search Tree (BST) in structuring a guidance system for indoor parking. …”
Get full text
Get full text
Thesis -
7
Features selection for intrusion detection system using hybridize PSO-SVM
Published 2016“…Hybridize Particle Swarm Optimization (PSO) as a searching algorithm and support vector machine (SVM) as a classifier had been implemented to cope with this problem. …”
Get full text
Get full text
Thesis -
8
Algorithm in the fluidized-bed reactor for the polymerization of propylene
Published 2019“…The proposed algorithm is designed by improving the exploration knowledge of onlooker bee from meta-heuristic concept in search space. …”
Get full text
Get full text
Article -
9
CSC562: Information Retrieval and Searching Algorithms / College of Computing, Informatics and Media
Published 2022Get full text
Get full text
Get full text
Teaching Resource -
10
Resource management in grid computing using ant colony optimization
Published 2011“…Resources with high pheromone value are selected to process the submitted jobs.Global pheromone update is performed after completion processing the jobs in order to reduce the pheromone value of resources.A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against other ant based algorithm, in terms of resource utilization.Experimental results show that EACO produced better grid resource management solution.…”
Get full text
Get full text
Get full text
Get full text
Monograph -
11
-
12
The impact of population size on knowledge acquisition in genetic algorithms paradigm: Finding solutions in the game of Sudoku
Published 2010“…Population size is an important component in genetic algorithms (GAs).The concept of population in GAs has contributed to a unique searching strategy which empower its search process through the massive volume of the data in a population.The purpose of this study is to see how the impact of population size on genetic algorithms in producing correct solution for a Sudoku puzzle.Sudoku is a Japanese number puzzle game that has become a worldwide phenomenon.The puzzle involves completing a grid of cells by assigning a single number to each cell.The numbers in a row or a column must consist of any one of the numbers from 1 to 9; no repetition is allowed.GA will be used to generate the correct solution of Sudoku puzzles.The mechanism to produce legal Sudoku grid will follow the requirements needed and meet all the constraints.A fitness function is designed to evaluate legal grids and GA will be tested for performance and time efficiency.The challenges lie on how GA will represent a Sudoku grid in the process and the effectiveness of its operators such as crossover and mutation.The results show how different population size can produce different solutions.The best performance is observed at 500 population size.The paper will conclude with an insight of this value and its significance to the knowledge acquisition in GA paradigm..…”
Get full text
Get full text
Get full text
Conference or Workshop Item -
13
Implementation of locust inspired scheduling algorithm with huge number of servers for energy efficiency in a cloud datacenter
Published 2019“…Cloudsim is used as Discrete Event Simulation tool and Java as coding language to evaluate LACE algorithm. …”
Get full text
Get full text
Thesis -
14
Pseudo Randomized Search Strategy (PRSS*) of the ambiguity function mapping
Published 1998“…A combination between three methods of optimization, global random search and ambiguity function mapping produced an efficient search algorithm what the author called the Pseudo Randomized Search Strategy (PRSS). …”
Get full text
Get full text
Article -
15
-
16
Multilevel optimization for dense motion estimation
Published 2011“…We evaluated the performance of different optimization techniques developed in the context of optical flow computation with different variational models.In particular, based on truncated Newton methods (TN) that have been an effective approach for large-scale unconstrained optimization, we developed the use of efficient multilevel schemes for computing the optical flow.More precisely, we evaluated the performance of a standard unidirectional multilevel algorithm - called multiresolution optimization (MR/Opt), to a bidrectional multilevel algorithm - called full multigrid optimization (FMG/Opt).The FMG/Opt algorithm treats the coarse grid correction as an optimization search direction and eventually scales it using a line search. …”
Get full text
Get full text
Get full text
Monograph -
17
An efficient algorithm to discover large and frequent itemset in high dimensional data
Published 2019“…These approaches improved both memory and time requirement of the algorithms to finish mining tasks. Algorithm RARE searches the rowset lattice in breadth-first manner which resulted to a reduced itemset intersections compare to other state-of-the-art algorithms, CARPENTER and IsTa. …”
Get full text
Get full text
Monograph -
18
Evaluating JA-ABC5 hyperparameter optimisation with classifiers
Published 2024“…The Wisconsin dataset is used to evaluate the performance of these classifiers, and the hyperparameters are optimised using the JA-ABC5 algorithm. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
19
Effective query structuring with ranking using named entity categories for XML retrieval
Published 2016“…The systems focus on user query representation, user search intention identification and ranking algorithms to improve keyword search. …”
Get full text
Get full text
Get full text
Thesis -
20
Process Planning Optimization In Reconfigurable Manufacturing Systems
Published 2008“…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
Thesis
