Search
Now showing items 1-10 of 15
Asignación de frecuencias en telefonía celular aplicando el problema de coloracion robusta
Asignación de frecuencias en telefonía celular aplicando el problema de coloracion robusta
(2010-04-09)
The Robust Coloring Problem (RCP) is a NP-Hard Problem for which fast andefficient heuristic algorithms has been developed. In this work we present as a PCRthe problem of assignment of frequencies for a cellphone grid. ...
Un Algoritmo Evolutivo para Resolver el Problema de Coloración Robusta
Un Algoritmo Evolutivo para Resolver el Problema de Coloración Robusta
(2012-03-22)
Let G and \bar{G} be two complementary graphs. Given a penalty function defined over the edges of \bar{G}, it is said that the rigidity of a k-coloring of G is the summation ofthe penalties of the edges of G that join ...
Método heurístico para particionamiento óptimo
Método heurístico para particionamiento óptimo
(2009-02-20)
Many data analysis problems deal with non supervised partitioning of a data set,in non empty clusters well separated between them and homogeneous within the clusters.An ideal partitioning is obtained when any object can ...
Un algoritmo para el entrenamiento de máquinas de vector soporte para regresión
Un algoritmo para el entrenamiento de máquinas de vector soporte para regresión
(2009-02-19)
The aim of the present paper is twofold. Firstly an introduction to the ideas of Support Vector regression is given. then a new and simple algorithm, suggested by the work of Campbell y Cristianini in [16], is proposed ...
Artificial bee colony and particle swarm optimization for the estimation of nonlinear regression parameters
Colonia de abejas artificiales y optimización por enjambre de partículas para la estimación de parámetros de regresión no lineal
(2014-04-03)
This paper shows the comparison results of ABC (Artificial Bee Colony) and PSO (Particle Swarm Optimization) heuristic tech- niques that were used to estimate parameters for nonlinear regression models. The algorithms were ...
General guidelines solution for linear programming with fuzzy coefficients
Lineamientos generales de solución para programación lineal con coeficientes borrosos
(2013-08-29)
This work introduce to the Possibilistic Programming and the Fuzzy Programming as paradigms that allow to resolve problems of linear programming when the coefficients of the model or the restrictions on the same are presented ...
New geometrical compactness measures for zones design
Nuevas medidas de compacidad geométrica para el diseño de zonas
(2012-07-01)
The design of compact zones has been studied because of its influence in the creation of zones with regular forms, which are easier to analyze, to investigate or to administer. This paper propose a new method to measure ...
Un problema de localización de plantas de gran escala
(2009-02-19)
En este artículo se desarrolla un algoritmo heurístico y su correspondiente implementación para resolver un problema de localización de plantas (facility location) de gran escala, en donde surgen potencialmente más de 640 ...
Fuzzy Regression VS. Ordinary Least Squares Regression: Case Study
Regresión Borrosa VS. Regresión por Mínimos Cuadrados Ordinarios: Caso de Estudio
(2011-03-18)
The objective of this paper is to disseminate the technique of fuzzy regression and to give a practical example of its use. To this end, classical regression is compared to several fuzzy regression models on a problem ...
Heuristics for the Robust Coloring Problem
Heurísticas para el Problema de Coloracion Robusta
(2011-03-18)
Let $G$ and $\bar{G}$ be complementary graphs. Given a penalty function defined on the edges of $G$, we will say that the rigidity of a $k$-coloring of $G$ is the sum of the penalties of the edges of G joining vertices of ...