Buscar
Mostrando ítems 1-10 de 15
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 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 ...
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 ...
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. ...
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 ...
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 ...
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 ...
Una caracterización sobre las soluciones para el problema de reaprovisionamiento conjunto
Una caracterización sobre las soluciones para el problema de reaprovisionamiento conjunto
(2009-02-20)
In this paper an introduction is given to a multiple-item inventory problem, knownas the Joint Replenishment Problem (JRP). This is a real world problem which hasbeen extensively studied. The JRP has a continuous decision ...
El problema del conjunto independiente en la selección de horarios de cursos
El problema del conjunto independiente en la selección de horarios de cursos
(2009-02-20)
Registration process at the Universidad Aut´onoma Metropolitana is such thatevery student is free to choose his/her own subjects and schedule. Success of thissystem, based in the percentage of students that obtain a place ...
Simulated Annealing–Golden section algorithm for the multiproduct replenishment problem with stochastic demand.
Algoritmo recocido simulado–sección dorada para el problema de reaprovisionamiento multiproducto con demanda estocástica
(2010-07-02)
The joint replenishment problem (JRP) has been studied for over 30 years and there are both heuristic and exact algorithms to determine the frequency of orders and fundamental cycle; in recent years ithas been considered ...