Buscar
Mostrando ítems 1-10 de 12576
An artificial bee colony algorithm for the set covering problem
(Springer Verlag, 2014)
Reducing the Experiments Required to Assess the Performance of Metaheuristic Algorithms
(Revista Computación y Sistemas; Vol. 14 No.1, 2010-09-30)
Abstract. When assessing experimentally the performance of metaheuristic algorithms on a set of hard instances of an NP-complete problem, the required time to carry out the experimentation can be very large. A means to ...
Solving biobjective set covering problem using binary cat swarm optimization algorithm
(Springer Verlag, 2016)
Intrusion detection in computer networks using optimum-path forest clustering
(2012-12-01)
Nowadays, organizations face the problem of keeping their information protected, available and trustworthy. In this context, machine learning techniques have also been extensively applied to this task. Since manual labeling ...
Intrusion detection in computer networks using optimum-path forest clustering
(2012-12-01)
Nowadays, organizations face the problem of keeping their information protected, available and trustworthy. In this context, machine learning techniques have also been extensively applied to this task. Since manual labeling ...
BBA: A binary bat algorithm for feature selection
(2012-12-01)
Feature selection aims to find the most important information from a given set of features. As this task can be seen as an optimization problem, the combinatorial growth of the possible solutions may be in-viable for a ...
BBA: A binary bat algorithm for feature selection
(2012-12-01)
Feature selection aims to find the most important information from a given set of features. As this task can be seen as an optimization problem, the combinatorial growth of the possible solutions may be in-viable for a ...
Hybrid algorithms for solving Sudokus [Algoritmos híbridos para la resolución de Sudokus]
(Institute of Electrical and Electronics Engineers Inc., 2015)