Now showing items 21-30 of 16937
Binary Bat Algorithm for Feature Selection
Feature selection aims to find the most important information to save computational efforts and data storage. We formulated this task as a combinatorial optimization problem since the exponential growth of possible solutions ...
Hybrid evolutionary algorithm for the Capacitated Centered Clustering Problem
(Pergamon-Elsevier B.V. Ltd, 2011-05-01)
The Capacitated Centered Clustering Problem (CCCP) consists of defining a set of p groups with minimum dissimilarity on a network with n points. Demand values are associated with each point and each group has a demand ...
A Diversity-Adaptive Hybrid Evolutionary Algorithm to Solve a Project Scheduling Problem
In this paper, we address a project scheduling problem. This problem considers a priority optimization objective for project managers. This objective implies assigning the most effective set of human resources to each ...
CALMANT: A Systematic Method for the Execution of Hypercube Algorithms in Multiprocessor Systems
(Computación y Sistemas, 2009)
Agrupamento de sequências de miRNA utilizando aprendizado não-supervisionado baseado em grafos
(Universidade Federal de São CarlosUFSCarPrograma de Pós-graduação em Ciência da ComputaçãoCâmpus São Carlos, 2016-08-12)
Cluster analysis is the organization of a collection of patterns into clusters based on similarity which is determined by using properties of data. Clustering techniques can be useful in a variety of knowledge domains ...
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 ...
Optimization and Selection of Alternative Modular Structures using Genetic Algorithms
In most transformations from dedicated to modular approaches, products are assumed to have a unique modular structure. However, it is well known that alternatives for constructing modular structures may exist in any level ...
Algorithm 949: MATLAB tools for HDG in three dimensions
Heuristic Constraint-Path Routing Decision System
(IEEE Computer Society, 2005-05-18)
Heuristic QoS algorithms under strict constraints perform poorly in terms of finding a path that is suitable for a user?s QoS needs - the multiple constraint path problem (MCP). Exact QoS algorithms, on the other hand, ...