Guillermo Huerta Cuéllar

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
This paper is focused on introducing a Hill-Climbing algorithm as a way to solve the problem of generating typical testors – or non-reducible descriptors – from a training matrix. All the algorithms reported in the state-of-the-art have exponential complexity. However, there are problems for which there is no need to generate the whole set of typical(More)
  • 1