Search
Now showing items 1-6 of 6
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 ...
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 ...
Estimación de parámetros de regresión no lineal mediante colonia de abejas artificiales
(2013-04-04)
Este trabajo presenta los resultados de la técnica heurística de ABC (Artificial Bee Colony) utilizada para estimar los parámetros de modelos de regresión no lineal. El algoritmo fue probado sobre 27 bases de datos de la ...
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 ...
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. ...