Search
Now showing items 1-10 of 15
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 ...
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 ...
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 ...
Optimal design of networks and routing of computers: practical case
Diseño óptimo de redes y enrutamiento de computadoras: Caso Práctico
(2010-04-16)
This work introduced to the problem of routering and optimum design of networks of computers that must satisfy certain practical conditions of interconnectivity. This paper show an approach style Steiner problems, and ...
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 ...
Aplicación de la búsqueda tabú en regresión no lineal
Aplicación de la búsqueda tabú en regresión no lineal
(2009-02-20)
We implement the combinatorial optimization technique known as tabu search inthe parameter estimation problem in a given non linear model. For the generationof neighbors, the implementation is based on a discretization of ...
Una propuesta de Modelamiento para los Sistemas de Recompensa
Una propuesta de Modelamiento para los Sistemas de Recompensa
(2012-03-01)
One of the most important subjects of interest, in nearly any human activity, is the perception of salary. It could even be said that the decision of following a career depends deeply on the perspective that the individual ...
El problema del multicubrimiento: una aplicación para la selección de paradas en la red de transporte de la Ciudad de México
El problema del multicubrimiento: una aplicación para la selección de paradas en la red de transporte de la Ciudad de México
(2009-02-20)
In this paper an heuristic algorithm is developed. Its implementation is developedas well, in order to solve a sampling problem in the urban transportation network in Mexico City. The problem consist of the selection of ...
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. ...
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 ...