Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHugo Terashima-Marín
- > Home > Persons > Hugo Terashima-Marín
Publications
- 2022
[j27]Kevin B. Kwan-Loo, José Carlos Ortiz-Bayliss
, Santiago E. Conant-Pablos, Hugo Terashima-Marín, Peyman Najafirad:
Detection of Violent Behavior Using Neural Networks and Pose Estimation. IEEE Access 10: 86339-86352 (2022)- [i6]Roberto García-Torres, Alitzel Adriana Macias-Infante, Santiago Enrique Conant-Pablos, José Carlos Ortiz-Bayliss, Hugo Terashima-Marín:
Combining Constructive and Perturbative Deep Learning Algorithms for the Capacitated Vehicle Routing Problem. CoRR abs/2211.13922 (2022) - 2021
- [j23]Frumen Olivas, Iván Amaya, José Carlos Ortiz-Bayliss, Santiago E. Conant-Pablos, Hugo Terashima-Marín:
Enhancing Hyperheuristics for the Knapsack Problem through Fuzzy Logic. Comput. Intell. Neurosci. 2021: 8834324:1-8834324:17 (2021) - [j19]Jorge M. Cruz-Duarte, Iván Amaya, José Carlos Ortiz-Bayliss, Santiago E. Conant-Pablos, Hugo Terashima-Marín, Yong Shi:
Hyper-Heuristics to customise metaheuristics for continuous optimisation. Swarm Evol. Comput. 66: 100935 (2021) - 2020
- [c75]Jorge M. Cruz-Duarte, Iván Amaya, José Carlos Ortiz-Bayliss, Santiago Enrique Conant-Pablos, Hugo Terashima-Marín:
A Primary Study on Hyper-Heuristics to Customise Metaheuristics for Continuous optimisation. CEC 2020: 1-8 - [c73]Frumen Olivas, Iván Amaya, José Carlos Ortiz-Bayliss, Santiago E. Conant-Pablos, Hugo Terashima-Marín:
A Fuzzy Hyper-Heuristic Approach for the 0-1 Knapsack Problem. CEC 2020: 1-8 - [c72]Xavier Sánchez, José Carlos Ortiz-Bayliss, Iván Amaya, Jorge M. Cruz-Duarte, Santiago Enrique Conant-Pablos, Hugo Terashima-Marín:
A Preliminary Study on Feature-independent Hyper-heuristics for the 0/1 Knapsack Problem. CEC 2020: 1-8 - 2019
- [j16]Andrés Eduardo Gutiérrez-Rodríguez, Santiago E. Conant-Pablos, José Carlos Ortiz-Bayliss, Hugo Terashima-Marín:
Selecting meta-heuristics for solving vehicle routing problems with time windows via meta-learning. Expert Syst. Appl. 118: 470-481 (2019) - [j15]Luis Fernando Plata-González, Iván Amaya, José Carlos Ortiz-Bayliss, Santiago Enrique Conant-Pablos, Hugo Terashima-Marín, Carlos A. Coello Coello:
Evolutionary-based tailoring of synthetic instances for the Knapsack problem. Soft Comput. 23(23): 12711-12728 (2019) - [c69]Fernando Garza-Santisteban, Roberto Sánchez-Pámanes, Luis Antonio Puente Rodríguez, Iván Amaya, José Carlos Ortiz-Bayliss, Santiago E. Conant-Pablos, Hugo Terashima-Marín:
A Simulated Annealing Hyper-heuristic for Job Shop Scheduling Problems. CEC 2019: 57-64 - [c68]Iván Amaya, José Carlos Ortiz-Bayliss, Santiago E. Conant-Pablos, Hugo Terashima-Marín:
Hyper-heuristics Reversed: Learning to Combine Solvers by Evolving Instances. CEC 2019: 1790-1797 - [c67]Fernando Garza-Santisteban, Jorge M. Cruz-Duarte, Iván Amaya, José Carlos Ortiz-Bayliss, Santiago Enrique Conant-Pablos, Hugo Terashima-Marín:
Influence of Instance Size on Selection Hyper-Heuristics for Job Shop Scheduling Problems. SSCI 2019: 1708-1715 - 2018
- [j13]Iván Amaya, José Carlos Ortiz-Bayliss, Alejandro Rosales-Pérez, Andrés Eduardo Gutiérrez-Rodríguez, Santiago E. Conant-Pablos, Hugo Terashima-Marín, Carlos A. Coello Coello:
Enhancing Selection Hyper-Heuristics via Feature Transformations. IEEE Comput. Intell. Mag. 13(2): 30-41 (2018) - [j12]José Carlos Ortiz-Bayliss, Iván Amaya, Santiago Enrique Conant-Pablos, Hugo Terashima-Marín:
Exploring the Impact of Early Decisions in Variable Ordering for Constraint Satisfaction Problems. Comput. Intell. Neurosci. 2018: 6103726:1-6103726:14 (2018) - [c64]Iván Amaya, José Carlos Ortiz-Bayliss, Santiago Enrique Conant-Pablos, Hugo Terashima-Marín, Carlos A. Coello Coello:
Tailoring Instances of the 1D Bin Packing Problem for Assessing Strengths and Weaknesses of Its Solvers. PPSN (2) 2018: 373-384 - [i1]Iván Amaya, José Carlos Ortiz-Bayliss, Alejandro Rosales-Pérez, Andrés Eduardo Gutiérrez-Rodríguez, Santiago E. Conant-Pablos, Hugo Terashima-Marín, Carlos A. Coello Coello:
Enhancing Selection Hyper-heuristics via Feature Transformations. CoRR abs/1812.05070 (2018) - 2017
- [c61]Andrés Eduardo Gutiérrez-Rodríguez, José Carlos Ortiz-Bayliss, Alejandro Rosales-Pérez, Ivan M. Amaya-Contreras, Santiago E. Conant-Pablos, Hugo Terashima-Marín, Carlos A. Coello Coello:
Applying automatic heuristic-filtering to improve hyper-heuristic performance. CEC 2017: 2638-2644 - 2016
- [j9]José Carlos Ortiz-Bayliss, Hugo Terashima-Marín, Santiago Enrique Conant-Pablos:
Combine and conquer: an evolutionary hyper-heuristic approach for solving constraint satisfaction problems. Artif. Intell. Rev. 46(3): 327-349 (2016) - [j8]Jorge Humberto Moreno-Scott, José Carlos Ortiz-Bayliss, Hugo Terashima-Marín, Santiago Enrique Conant-Pablos:
Experimental Matching of Instances to Heuristics for Constraint Satisfaction Problems. Comput. Intell. Neurosci. 2016: 7349070:1-7349070:15 (2016) - [j7]José Carlos Ortiz-Bayliss, Hugo Terashima-Marín, Santiago Enrique Conant-Pablos:
A Neuro-evolutionary Hyper-heuristic Approach for Constraint Satisfaction Problems. Cogn. Comput. 8(3): 429-441 (2016) - [j6]Alejandro Sosa-Ascencio, Gabriela Ochoa, Hugo Terashima-Marín, Santiago Enrique Conant-Pablos:
Grammar-based generation of variable-selection heuristics for constraint satisfaction problems. Genet. Program. Evolvable Mach. 17(2): 119-144 (2016) - [c59]Alejandro Sosa-Ascencio, Hugo Terashima-Marín, José Carlos Ortiz-Bayliss, Santiago E. Conant-Pablos:
Grammar-based Selection Hyper-heuristics for Solving Irregular Bin Packing Problems. GECCO (Companion) 2016: 111-112 - 2015
- [c57]José Carlos Ortiz-Bayliss, Dulce Jaqueline Magaña-Lozano, Hugo Terashima-Marín, Santiago Enrique Conant-Pablos:
A Recursive Split, Solve, and Join Strategy for Solving Constraint Satisfaction Problems. MICAI (Special Sessions) 2015: 73-79 - [c56]José Carlos Ortiz-Bayliss, Hugo Terashima-Marín, Santiago Enrique Conant-Pablos:
Lifelong Learning Selection Hyper-heuristics for Constraint Satisfaction Problems. MICAI (1) 2015: 190-201 - 2014
- [c55]Edgar Reyna-Ayala, Santiago E. Conant-Pablos, Hugo Terashima-Marín:
Assembling Similar Tracking Approaches in Order to Strengthen Performance. MCPR 2014: 201-210 - 2013
- [j3]José Carlos Ortiz-Bayliss, Hugo Terashima-Marín, Santiago Enrique Conant-Pablos:
Learning vector quantization for variable ordering in constraint satisfaction problems. Pattern Recognit. Lett. 34(4): 423-432 (2013) - [c52]José Carlos Ortiz-Bayliss, Hugo Terashima-Marín, Santiago E. Conant-Pablos:
Using learning classifier systems to design selective hyper-heuristics for constraint satisfaction problems. IEEE Congress on Evolutionary Computation 2013: 2618-2625 - [c51]José Carlos Ortiz-Bayliss, Hugo Terashima-Marín, Ender Ozcan, Andrew J. Parkes, Santiago E. Conant-Pablos:
Exploring heuristic interactions in constraint satisfaction problems: A closer look at the hyper-heuristic space. IEEE Congress on Evolutionary Computation 2013: 3307-3314 - [c50]José Carlos Ortiz-Bayliss, Hugo Terashima-Marín, Santiago Enrique Conant-Pablos:
A Supervised Learning Approach to Construct Hyper-heuristics for Constraint Satisfaction. MCPR 2013: 284-293 - [c47]José Carlos Ortiz-Bayliss, Hugo Terashima-Marín, Santiago Enrique Conant-Pablos:
Branching Schemes and Variable Ordering Heuristics for Constraint Satisfaction Problems: Is There Something to Learn? NICSO 2013: 329-342 - 2012
- [c45]Jorge Humberto Moreno-Scott, José Carlos Ortiz-Bayliss, Hugo Terashima-Marín, Santiago Enrique Conant-Pablos:
Challenging heuristics: evolving binary constraint satisfaction problems. GECCO 2012: 409-416 - [c44]José Carlos Ortiz-Bayliss, Hugo Terashima-Marín, Santiago Enrique Conant-Pablos, Ender Özcan, Andrew J. Parkes:
Improving the performance of vector hyper-heuristics through local search. GECCO 2012: 1269-1276 - [c43]Eunice López-Camacho, Hugo Terashima-Marín, Santiago Enrique Conant-Pablos:
The impact of the bin packing problem structure in hyper-heuristic performance. GECCO (Companion) 2012: 1545-1546 - [c41]Alan I. Torres-Nogales, Santiago E. Conant-Pablos, Hugo Terashima-Marín:
Local Features Classification for Adaptive Tracking. MICAI (1) 2012: 146-157 - [c40]Dulce J. Magaña-Lozano, Santiago E. Conant-Pablos, Hugo Terashima-Marín:
Exploring the Solution of Course Timetabling Problems through Heuristic Segmentation. MICAI (1) 2012: 347-358 - 2011
- [c39]Santiago Enrique Conant-Pablos, Halley Jarumy Ferrer-Soriano, Hugo Terashima-Marín:
Evolving solutions of mixed-model assembly line balancing problems by chaining heuristic optimization methods: track: evolutionary combinatorial optimization and meta-heuristics. GECCO (Companion) 2011: 49-50 - [c36]José Carlos Ortiz-Bayliss, Hugo Terashima-Marín, Peter Ross, Santiago Enrique Conant-Pablos:
Evolution of neural networks topologies and learning parameters to produce hyper-heuristics for constraint satisfaction problems. GECCO (Companion) 2011: 261-262 - [c35]José Carlos Ortiz-Bayliss, Hugo Terashima-Marín, Santiago E. Conant-Pablos:
Neural Networks to Guide the Selection of Heuristics within Constraint Satisfaction Problems. MCPR 2011: 250-259 - [c34]José Carlos Ortiz-Bayliss, Hugo Terashima-Marín, Ender Özcan, Andrew J. Parkes, Santiago Enrique Conant-Pablos:
Variable and Value Ordering Decision Matrix Hyper-heuristics: A Local Improvement Approach. MICAI (1) 2011: 125-136 - [p2]Santiago E. Conant-Pablos, Rolando R. Hernández-Cisneros, Hugo Terashima-Marín:
Feature Selection for the Classification of Microcalcifications in Digital Mammograms using Genetic Algorithms, Sequential Search and Class Separability. Genetic and Evolutionary Computation: Medical Applications 2011 - 2009
- [c27]Santiago E. Conant-Pablos, Dulce J. Magaña-Lozano, Hugo Terashima-Marín:
Pipelining Memetic Algorithms, Constraint Satisfaction, and Local Search for Course Timetabling. MICAI 2009: 408-419 - 2007
- [c19]Rolando R. Hernández-Cisneros, Hugo Terashima-Marín, Santiago E. Conant-Pablos:
Comparison of Class Separability, Forward Sequential Search and Genetic Algorithms for Feature Selection in the Classification of Individual and Clustered Microcalcifications in Digital Mammograms. ICIAR 2007: 911-922
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-21 17:07 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
