Santiago Enrique Conant-Pablos

Publication Activity (10 Years)

Years Active: 2011-2024
Publications (10 Years): 14

Top Topics

Constraint Satisfaction Problems

Routing Problem

Lifelong Learning

Top Venues

Comput. Intell. Neurosci.

Publications

Gabriel Gonzalez-Sahagun, Santiago Enrique Conant-Pablos, José Carlos Ortiz-Bayliss, Jorge M. Cruz-Duarte
A Generalist Reinforcement Learning Agent for Compressing Convolutional Neural Networks. IEEE Access 12 (2024)
Diego Acosta-Ugalde, Santiago Enrique Conant-Pablos, Claudia Camacho-Zuñiga, Andrés Eduardo Gutiérrez-Rodríguez
Data Mining and Analysis of NLP Methods in Students Evaluation of Teaching. MICAI (2) (2023)
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 (2022)
Fernando Isunza Fonseca, Diego Villarreal Gutiérrez, Santiago Enrique Conant-Pablos
A New Methodology for Solving the Vehicle Routing Problem with Time Windows Using Weighted Heuristics. Res. Comput. Sci. 149 (10) (2020)
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)
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)
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)
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) (2019)
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)
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 (2018)
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 (2016)
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) (2016)
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) (2016)
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) (2016)
José Carlos Ortiz-Bayliss, Hugo Terashima-Marín, Santiago Enrique Conant-Pablos
Lifelong Learning Selection Hyper-heuristics for Constraint Satisfaction Problems. MICAI (1) (2015)
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)
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) (2013)
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)
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)
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)
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)
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)
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)
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)
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)