H
Hugo Terashima-Marín
Researcher at Monterrey Institute of Technology and Higher Education
Publications - 125
Citations - 1687
Hugo Terashima-Marín is an academic researcher from Monterrey Institute of Technology and Higher Education. The author has contributed to research in topics: Heuristics & Constraint satisfaction problem. The author has an hindex of 20, co-authored 121 publications receiving 1304 citations.
Papers
More filters
Proceedings Article
Evolution of Constraint Satisfaction strategies in examination timetabling
Abstract: This paper describes an investigation of solving Examination Timetabling Problems (ETTPs) with Genetic Algorithms (GAs) using a non-direct chromosome representation based on evolving the configuration of Constraint Satisfaction methods. There are two aims. The first is to circumvent the problems posed by a direct chromosome representation for the ETTP that consists of an array of events in which each value represents the timeslot which the corresponding event is assigned to. The second is to show that the adaptation of particular features in both the instance of the problem to be solved and the strategies used to solve it provides encouraging results for real ETTPs. There is much scope for investigating such approaches further, not only for the ETTP, but also for other related scheduling problems.
Book
MICAI 2005 : advances in artificial intelligence : 4th Mexican International Conference on Artificial Intelligence, Monterrey, Mexico, November 14-18, 2005 : proceedings
TL;DR: In this article, the authors present an approach for dynamic split strategies in Constraint Problem Solving using Fuzzy Extension of Description Logic (DELL) for solving the Stereo Correspondence Problem.
Journal ArticleDOI
Generalized hyper-heuristics for solving 2D Regular and Irregular Packing Problems
Hugo Terashima-Marín,Peter Ross,C. J. Farías-Zárate,Eunice López-Camacho,Manuel Valenzuela-Rendón +4 more
TL;DR: A GA-based method that produces general hyper-heuristics that solve two-dimensional regular (rectangular) and irregular (convex polygonal) bin-packing problems and a variable-length representation is presented.
BookDOI
MICAI 2005: Advances in Artificial Intelligence
TL;DR: A Neurobiologically Motivated Model for Self-organized Learning and Using Boolean Differences for Discovering Ill-Defined Attributes in Propositional Machine Learning.
Journal ArticleDOI
A unified hyper-heuristic framework for solving bin packing problems
TL;DR: A hyper-heuristic methodology is described that can generate a fast, deterministic algorithm capable of producing results comparable to that of using the best problem-specific heuristic, and sometimes even better, but without the cost of trying all the heuristics.