Santiago E. Conant-Pablos

Orcid: 0000-0001-6270-3164

According to our database1, Santiago E. Conant-Pablos authored at least 46 papers between 2003 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A Generalist Reinforcement Learning Agent for Compressing Convolutional Neural Networks.
IEEE Access, 2024

2023
Data Mining and Analysis of NLP Methods in Students Evaluation of Teaching.
Proceedings of the Advances in Soft Computing, 2023

2022
Combining Constructive and Perturbative Deep Learning Algorithms for the Capacitated Vehicle Routing Problem.
CoRR, 2022

Detection of Violent Behavior Using Neural Networks and Pose Estimation.
IEEE Access, 2022

2021
Hyper-Heuristics to customise metaheuristics for continuous optimisation.
Swarm Evol. Comput., 2021

Enhancing Hyperheuristics for the Knapsack Problem through Fuzzy Logic.
Comput. Intell. Neurosci., 2021

2020
A New Methodology for Solving the Vehicle Routing Problem with Time Windows Using Weighted Heuristics.
Res. Comput. Sci., 2020

A Preliminary Study on Feature-independent Hyper-heuristics for the 0/1 Knapsack Problem.
Proceedings of the IEEE Congress on Evolutionary Computation, 2020

A Fuzzy Hyper-Heuristic Approach for the 0-1 Knapsack Problem.
Proceedings of the IEEE Congress on Evolutionary Computation, 2020

A Primary Study on Hyper-Heuristics to Customise Metaheuristics for Continuous optimisation.
Proceedings of the IEEE Congress on Evolutionary Computation, 2020

2019
Evolutionary-based tailoring of synthetic instances for the Knapsack problem.
Soft Comput., 2019

Selecting meta-heuristics for solving vehicle routing problems with time windows via meta-learning.
Expert Syst. Appl., 2019

Influence of Instance Size on Selection Hyper-Heuristics for Job Shop Scheduling Problems.
Proceedings of the IEEE Symposium Series on Computational Intelligence, 2019

A Simulated Annealing Hyper-heuristic for Job Shop Scheduling Problems.
Proceedings of the IEEE Congress on Evolutionary Computation, 2019

Hyper-heuristics Reversed: Learning to Combine Solvers by Evolving Instances.
Proceedings of the IEEE Congress on Evolutionary Computation, 2019

2018
Exploring the Impact of Early Decisions in Variable Ordering for Constraint Satisfaction Problems.
Comput. Intell. Neurosci., 2018

Enhancing Selection Hyper-Heuristics via Feature Transformations.
IEEE Comput. Intell. Mag., 2018

Tailoring Instances of the 1D Bin Packing Problem for Assessing Strengths and Weaknesses of Its Solvers.
Proceedings of the Parallel Problem Solving from Nature - PPSN XV, 2018

2017
Applying automatic heuristic-filtering to improve hyper-heuristic performance.
Proceedings of the 2017 IEEE Congress on Evolutionary Computation, 2017

2016
Grammar-based generation of variable-selection heuristics for constraint satisfaction problems.
Genet. Program. Evolvable Mach., 2016

A Neuro-evolutionary Hyper-heuristic Approach for Constraint Satisfaction Problems.
Cogn. Comput., 2016

Experimental Matching of Instances to Heuristics for Constraint Satisfaction Problems.
Comput. Intell. Neurosci., 2016

Combine and conquer: an evolutionary hyper-heuristic approach for solving constraint satisfaction problems.
Artif. Intell. Rev., 2016

Grammar-based Selection Hyper-heuristics for Solving Irregular Bin Packing Problems.
Proceedings of the Genetic and Evolutionary Computation Conference, 2016

2015
Lifelong Learning Selection Hyper-heuristics for Constraint Satisfaction Problems.
Proceedings of the Advances in Artificial Intelligence and Soft Computing, 2015

A Recursive Split, Solve, and Join Strategy for Solving Constraint Satisfaction Problems.
Proceedings of the Fourteenth Mexican International Conference on Artificial Intelligence, 2015

2014
Assembling Similar Tracking Approaches in Order to Strengthen Performance.
Proceedings of the Pattern Recognition - 6th Mexican Conference, 2014

2013
Learning vector quantization for variable ordering in constraint satisfaction problems.
Pattern Recognit. Lett., 2013

Branching Schemes and Variable Ordering Heuristics for Constraint Satisfaction Problems: Is There Something to Learn?
Proceedings of the Nature Inspired Cooperative Strategies for Optimization (NICSO 2013), 2013

A Supervised Learning Approach to Construct Hyper-heuristics for Constraint Satisfaction.
Proceedings of the Pattern Recognition - 5th Mexican Conference, 2013

Exploring heuristic interactions in constraint satisfaction problems: A closer look at the hyper-heuristic space.
Proceedings of the IEEE Congress on Evolutionary Computation, 2013

Using learning classifier systems to design selective hyper-heuristics for constraint satisfaction problems.
Proceedings of the IEEE Congress on Evolutionary Computation, 2013

2012
Local Features Classification for Adaptive Tracking.
Proceedings of the Advances in Artificial Intelligence, 2012

Exploring the Solution of Course Timetabling Problems through Heuristic Segmentation.
Proceedings of the Advances in Artificial Intelligence, 2012

Improving the performance of vector hyper-heuristics through local search.
Proceedings of the Genetic and Evolutionary Computation Conference, 2012

Challenging heuristics: evolving binary constraint satisfaction problems.
Proceedings of the Genetic and Evolutionary Computation Conference, 2012

The impact of the bin packing problem structure in hyper-heuristic performance.
Proceedings of the Genetic and Evolutionary Computation Conference, 2012

2011
Variable and Value Ordering Decision Matrix Hyper-heuristics: A Local Improvement Approach.
Proceedings of the Advances in Artificial Intelligence, 2011

Neural Networks to Guide the Selection of Heuristics within Constraint Satisfaction Problems.
Proceedings of the Pattern Recognition - Third Mexican Conference, 2011

Evolution of neural networks topologies and learning parameters to produce hyper-heuristics for constraint satisfaction problems.
Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference, 2011

Evolving solutions of mixed-model assembly line balancing problems by chaining heuristic optimization methods: track: evolutionary combinatorial optimization and meta-heuristics.
Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference, 2011

Feature Selection for the Classification of Microcalcifications in Digital Mammograms using Genetic Algorithms, Sequential Search and Class Separability.
Proceedings of the Genetic and Evolutionary Computation: Medical Applications, 2011

2009
Pipelining Memetic Algorithms, Constraint Satisfaction, and Local Search for Course Timetabling.
Proceedings of the MICAI 2009: Advances in Artificial Intelligence, 2009

2007
Comparison of Class Separability, Forward Sequential Search and Genetic Algorithms for Feature Selection in the Classification of Individual and Clustered Microcalcifications in Digital Mammograms.
Proceedings of the Image Analysis and Recognition, 4th International Conference, 2007

2004
A Method to Obtain Sensing Requirements in Robotic Assemblies by Geometric Reasoning.
Proceedings of the MICAI 2004: Advances in Artificial Intelligence, 2004

2003
Sensing requirements for robotic assembly from an analysis of critical contact transitions.
Proceedings of the IEEE International Conference on Systems, 2003


  Loading...