Now showing items 1-3 of 3

• #### 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 ...