Now showing items 1-11 of 11

• A genetic algorithm in a schedule problem with special constraints ﻿

(2011-07-08)
Ramírez (2001) introduced the generalized robust coloring problem (GRCP), this problem lets solve timetabling problems which considers constraints such as: two events can not be assigned at the same time and there must be ...
• Algoritmo de búsqueda tabú para una variante del problema de coloración ﻿

(2013-08-29)
El problema de coloración robusta generalizado (PCRG) resuelve problemas de horarios que consideran restricciones especiales. Al ser una generalización del problema de coloración robusta, que es a su vez una generalización ...
• Analysis and Design of the Knowledge Representation for the Implementation of a Distributed Reasoning ﻿

(2011-04-29)
The representation of knowledge and the reasoning comprise fundamental parts of the design of an expert system. In the case under study the real world is represented by the different events that can arise in the operation ...
• Application of a cognitive model of emotional appraisal to the board evaluation function of a program that plays chess ﻿

(2012-07-01)
This paper describes the analysis and design of a cognitive emotional assesment model. This model is based on the goals looked for a chess player during a game. The model affects the output of the board evaluation function ...
• 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 ...
• Evaluación de un algoritmo de recocido simulado con superficies de respuestas ﻿

(2009-02-27)
The solution of the geographical clustering problem includes a combinatorial classificationof the geographical units. The aggregation proposed in this work requiresan objective function that minimizes the distance between ...
• Heuristic for Solving the Multiple Alignment Sequence Problem ﻿

(2011-03-18)
In this paper we developed a new algorithm for solving the problem of multiple sequence alignment (AM S), which is a hybrid metaheuristic based on harmony search and simulated annealing. The hybrid was validated with the ...
• Heuristics for the Robust Coloring Problem ﻿

(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 ...
• Minimal Reducts with Grasp ﻿

(2011-03-18)
The proper detection of patient level of dementia is important to offer the suitable treatment. The diagnosis is based on certain criteria, reflected in the clinical examinations. From these examinations emerge the limitations ...
• An optimization algorithm inspired by musical composition in constrained optimization problems ﻿

(2013-08-29)
Many real-world problems can be expressed as an instance of the constrained nonlinear optimization problem (CNOP). This problem has a set of constraints specifies the feasible solution space. In the last years several ...
• 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 ...