Jose Torres-Jimenez

Germán Lescano

Carlos Lara-Alvarez

Hugo A. Mitre-Hernández

Educ. Inf. Technol., September, 2023

2022

New upper bounds for sequence Covering Arrays using a 3-stage approach.

[BibT_eX]

[DOI]

Daniel Osvaldo Ramirez-Acuna

Brenda Acevedo-Juárez

Expert Syst. Appl., 2022

2021

Cartesian product of sets without repeated elements.

[BibT_eX]

[DOI]

Carlos Alberto Cobos Lozada

Carlos Lara-Alvarez

Roberto Blanco-Rocha

Alfredo Cardenas-Castillo

Inf. Sci., 2021

Detecting conflicts in collaborative learning through the valence change of atomic interactions.

[BibT_eX]

[DOI]

Expert Syst. Appl., 2021

Covering array EXtender.

[BibT_eX]

[DOI]

Brenda Acevedo-Juárez

Appl. Math. Comput., 2021

Three Representations for Set Partitions.

[BibT_eX]

[DOI]

Alfredo Cardenas-Castillo

Carlos Lara-Alvarez

Roberto Blanco-Rocha

Oscar Puga-Sanchez

IEEE Access, 2021

2020

Improved covering arrays using covering perfect hash families with groups of restricted entries.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2020

2019

A greedy algorithm to construct covering arrays using a graph representation.

[BibT_eX]

[DOI]

Jose Carlos Perez-Torres

Inf. Sci., 2019

A low spatial complexity algorithm to generate combinations with the strong minimal change property.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2019

New covering array numbers.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2019

Methods to Construct Uniform Covering Arrays.

[BibT_eX]

[DOI]

IEEE Access, 2019

Wrapper for Building Classification Models Using Covering Arrays.

[BibT_eX]

[DOI]

IEEE Access, 2019

2018

A greedy-metaheuristic 3-stage approach to construct covering arrays.

[BibT_eX]

[DOI]

Brenda Acevedo-Juárez

Inf. Sci., 2018

<i>Research Notes</i>: Binary Test-Suites Using Covering Arrays.

[BibT_eX]

[DOI]

Ezra Federico Parra-González

Int. J. Softw. Eng. Knowl. Eng., 2018

Search-based software engineering for constructing covering arrays.

[BibT_eX]

[DOI]

IET Softw., 2018

Improved pairwise test suites for non-prime-power orders.

[BibT_eX]

[DOI]

IET Softw., 2018

New optimal covering arrays using an orderly algorithm.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2018

Covering arrays of strength three from extended permutation vectors.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2018

A multiobjective bilevel approach based on global-best harmony search for defining optimal routes and frequencies for bus rapid transit systems.

[BibT_eX]

[DOI]

Appl. Soft Comput., 2018

A Proposal to Estimate the Variable Importance Measures in Predictive Models Using Results from a Wrapper.

[BibT_eX]

[DOI]

Proceedings of the Mining Intelligence and Knowledge Exploration, 2018

Memetic Algorithm for Constructing Covering Arrays of Variable Strength Based on Global-Best Harmony Search and Simulated Annealing.

[BibT_eX]

[DOI]

Jimena Timaná

Carlos Cobos

Proceedings of the Advances in Soft Computing, 2018

Mining Dynamic Network-Wide Traffic States.

[BibT_eX]

[DOI]

Proceedings of the 21st International Conference on Intelligent Transportation Systems, 2018

2017

A graph-based postoptimization approach for covering arrays.

[BibT_eX]

[DOI]

Jose Carlos Perez-Torres

Qual. Reliab. Eng. Int., 2017

A two-stage algorithm for combinatorial testing.

[BibT_eX]

[DOI]

Optim. Lett., 2017

<i>hClique</i>: An exact algorithm for maximum clique problem in uniform hypergraphs.

[BibT_eX]

[DOI]

Gildardo Maldonado-Martinez

Jose Carlos Perez-Torres

Discret. Math. Algorithms Appl., 2017

Near-optimal algorithm to count occurrences of subsequences of a given length.

[BibT_eX]

[DOI]

Daniel Ramirez-Acuna

René Peralta

Discret. Math. Algorithms Appl., 2017

Metaheuristic post-optimization of the NIST repository of covering arrays.

[BibT_eX]

[DOI]

CAAI Trans. Intell. Technol., 2017

2016

Construction of non-isomorphic covering arrays.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2016

Transit Network Frequencies-Setting Problem Solved Using a New Multi-Objective Global-Best Harmony Search Algorithm and Discrete Event Simulation.

[BibT_eX]

[DOI]

Edgar Ruano

Carlos Cobos

Proceedings of the Advances in Soft Computing, 2016

Clustering Business Process Models Based on Multimodal Search and Covering Arrays.

[BibT_eX]

[DOI]

Hugo Ordoñez

Carlos Alberto Cobos Lozada

Armando Ordóñez

Proceedings of the Advances in Soft Computing, 2016

2015

Erratum to: Supercomputing and grid computing on the verification of covering arrays.

[BibT_eX]

[DOI]

J. Supercomput., 2015

A dual representation simulated annealing algorithm for the bandwidth minimization problem on graphs.

[BibT_eX]

[DOI]

Alberto Garcia-Robledo

Aldo Gonzalez-Gomez

Javier Bernal

Raghu Kacker

Inf. Sci., 2015

Construction of Mixed Covering Arrays Using a Combination of Simulated Annealing and Variable Neighborhood Search.

[BibT_eX]

[DOI]

Wilfrido Gómez-Flores

Wagner Coelho A. Pereira

Electron. Notes Discret. Math., 2015

A grouping genetic algorithm with controlled gene transmission for the bin packing problem.

[BibT_eX]

[DOI]

Adriana C. F. Alvim

Comput. Oper. Res., 2015

A Branch & Bound Algorithm to Derive a Direct Construction for Binary Covering Arrays.

[BibT_eX]

[DOI]

Aldo Gonzalez-Gomez

Proceedings of the Advances in Artificial Intelligence and Soft Computing, 2015

Exciting FPGA cryptographic Trojans using combinatorial testing.

[BibT_eX]

[DOI]

Paris Kitsos

Dimitris E. Simos

Artemios G. Voyiatzis

Proceedings of the 26th IEEE International Symposium on Software Reliability Engineering, 2015

Equivalence class verification and oracle-free testing using two-layer covering arrays.

[BibT_eX]

[DOI]

Proceedings of the Eighth IEEE International Conference on Software Testing, 2015

2014

Characterization of the Optimization Process.

[BibT_eX]

[DOI]

Patricia Melin

Proceedings of the Recent Advances on Hybrid Approaches for Designing Intelligent Systems, 2014

Applications of metaheuristics in real-life problems.

[BibT_eX]

[DOI]

Juan Pavón

Prog. Artif. Intell., 2014

2013

A Genetic Algorithm for the Problem of Minimal Brauer Chains for Large Exponents.

[BibT_eX]

[DOI]

Proceedings of the Soft Computing Applications in Optimization, Control, and Recognition, 2013

A Genetic Algorithm for the Problem of Minimal Brauer Chains.

[BibT_eX]

[DOI]

Proceedings of the Recent Advances on Hybrid Intelligent Systems, 2013

Improving the Performance of Heuristic Algorithms Based on Exploratory Data Analysis.

[BibT_eX]

[DOI]

Héctor J. Fraire H.

Patricia Melin

Proceedings of the Recent Advances on Hybrid Intelligent Systems, 2013

MiTS in Depth: An Analysis of Distinct Tabu Search Configurations for Constructing Mixed Covering Arrays.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence, Evolutionary Computing and Metaheuristics, 2013

SAT Model for the Curriculum-Based Course Timetabling Problem.

[BibT_eX]

[DOI]

Mario Humberto Rodriguez-Chavez

Jorge Omar Jasso-Luna

Res. Comput. Sci., 2013

Metaheuristic approach for constructing functional test-suites.

[BibT_eX]

[DOI]

IET Softw., 2013

Survey of Covering Arrays.

[BibT_eX]

[DOI]

Proceedings of the 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2013

A Max-SAT-Based Approach to Constructing Optimal Covering Arrays.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence Research and Development, 2013

2012

Supercomputing and grid computing on the verification of covering arrays.

[BibT_eX]

[DOI]

J. Supercomput., 2012

New bounds for binary covering arrays using simulated annealing.

[BibT_eX]

[DOI]

Inf. Sci., 2012

A Simulated Annealing with Variable Neighborhood Search Approach to Construct Mixed Covering Arrays.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2012

Construction of Mixed Covering Arrays of strengths 2 through 6 Using a Tabu Search Approach.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2012

Cover starters for covering arrays of strength two.

[BibT_eX]

[DOI]

Discret. Math., 2012

Heurísticas de agrupación híbridas eficientes para el problema.

[BibT_eX]

[DOI]

Adriana C. F. Alvim

Computación y Sistemas, 2012

A Post-optimization Strategy for Combinatorial Testing: Test Suite Reduction through the Identification of Wild Cards and Merge of Rows.

[BibT_eX]

[DOI]

Josue Bracho-Ríos

Proceedings of the Advances in Computational Intelligence, 2012

Constructing Real Test-Suites Using an Enhanced Simulated Annealing.

[BibT_eX]

[DOI]

Proceedings of the Advances in Artificial Intelligence - IBERAMIA 2012, 2012

Simulated Annealing for Constructing Mixed Covering Arrays.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing and Artificial Intelligence, 2012

2011

An algorithm to compute integer ηth roots using subtractions.

[BibT_eX]

[DOI]

Pedro Quiz-Ramos

Int. J. Comput. Math., 2011

A Mutation-Selection Algorithm for the Problem of Minimum Brauer Chains.

[BibT_eX]

[DOI]

Cindy G. Hernandez-Morales

Ivan Rivera-Islas

Hillel Romero-Monsivais

Adán José García

Proceedings of the Advances in Soft Computing, 2011

Improving the Performance of Heuristic Algorithms Based on Causal Inference.

[BibT_eX]

[DOI]

Jesús Eduardo Carrillo Ibarra

Mario César López Locés

Guadalupe Castilla Valdez

Proceedings of the Advances in Artificial Intelligence, 2011

An Exact Approach to Maximize the Number of Wild Cards in a Covering Array.

[BibT_eX]

[DOI]

Oscar Carrizales-Turrubiates

Proceedings of the Advances in Artificial Intelligence, 2011

Optimal Shortening of Covering Arrays.

[BibT_eX]

[DOI]

Cindy G. Hernandez-Morales

Proceedings of the Advances in Artificial Intelligence, 2011

A Simulated Annealing Algorithm for the Problem of Minimal Addition Chains.

[BibT_eX]

[DOI]

Adán José García

Hillel Romero-Monsivais

Ivan Rivera-Islas

Proceedings of the Progress in Artificial Intelligence, 2011

2010

MiTS: A New Approach of Tabu Search for Constructing Mixed Covering Arrays.

[BibT_eX]

[DOI]

Proceedings of the Advances in Soft Computing, 2010

Optimization of Investment Options Using SQL.

[BibT_eX]

[DOI]

Proceedings of the Advances in Artificial Intelligence, 2010

A Heuristic Approach for Constructing Ternary Covering Arrays Using Trinomial Coefficients.

[BibT_eX]

[DOI]

Proceedings of the Advances in Artificial Intelligence, 2010

Verification of General and Cyclic Covering Arrays Using Grid Computing.

[BibT_eX]

[DOI]

Proceedings of the Data Management in Grid and Peer-to-Peer Systmes, 2010

Construction of Mixed Covering Arrays of Variable Strength Using a Tabu Search Approach.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2010

Simulated Annealing for constructing binary covering arrays of variable strength.

[BibT_eX]

[DOI]

Proceedings of the IEEE Congress on Evolutionary Computation, 2010

2009

Phase Transition in the Bandwidth Minimization Problem.

[BibT_eX]

[DOI]

Proceedings of the MICAI 2009: Advances in Artificial Intelligence, 2009

A New Backtracking Algorithm for Constructing Binary Covering Arrays of Variable Strength.

[BibT_eX]

[DOI]

Josue Bracho-Ríos

Proceedings of the MICAI 2009: Advances in Artificial Intelligence, 2009

Problem and Algorithm Fine-Tuning - A Case of Study using Bridge Club and Simulated Annealing.

[BibT_eX]

Proceedings of the IJCCI 2009, 2009

Memetic Algorithms for Constructing Binary Covering Arrays of Strength Three.

[BibT_eX]

[DOI]

Proceedings of the Artifical Evolution, 2009

2008

An improved simulated annealing algorithm for bandwidth minimization.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2008

An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2008

Strength Two Covering Arrays Construction Using a SAT Representation.

[BibT_eX]

[DOI]

Daniel Lopez-Escogido

Proceedings of the MICAI 2008: Advances in Artificial Intelligence, 2008

An Ant Colony System Algorithm to Solve Routing Problems Applied to the Delivery of Bottled Products.

[BibT_eX]

[DOI]

José Francisco Delgado Orta

Juan Javier González Barbosa

Bárbara Abigail Arrañaga Cruz

Proceedings of the Foundations of Intelligent Systems, 17th International Symposium, 2008

Symbolic Summation of Polynomials in Linear Space and Quadratic Time.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Distributed Computing and Artificial Intelligence, 2008

2006

El Lenguaje MONIL, una Alternativa para la Integración de Datos.

[BibT_eX]

[DOI]

Computación y Sistemas, 2006

A Refined Evaluation Function for the MinLA Problem.

[BibT_eX]

[DOI]

Proceedings of the MICAI 2006: Advances in Artificial Intelligence, 2006

A Method for Software Architecture Design in the Aspect Oriented Development.

[BibT_eX]

Rogelio N. Limón Cordero

Isidro Ramos Salavert

Proceedings of the JIISIC'06, 2006

Designing Aspectual Architecture Views in Aspect-Oriented Software Development.

[BibT_eX]

[DOI]

Rogelio N. Limón Cordero

Isidro Ramos Salavert

Proceedings of the Computational Science and Its Applications, 2006

2005

A Comparison of Memetic Recombination Operators for the MinLA Problem.

[BibT_eX]

[DOI]

Proceedings of the MICAI 2005: Advances in Artificial Intelligence, 2005

Memetic Algorithms for the MinLA Problem.

[BibT_eX]

[DOI]

Proceedings of the Artificial Evolution, 2005

2004

An Improved Evaluation Function for the Bandwidth Minimization Problem.

[BibT_eX]

[DOI]

Proceedings of the Parallel Problem Solving from Nature, 2004

A Data Warehouse for Weather Information: A Pattern Recognition Solution for Climatic Conditions in México.

[BibT_eX]

Jesús Flores Gómez

Proceedings of the ICEIS 2004, 2004

Using a Goal-Refinement Tree to Obtain and Refine Organizational Requirements.

[BibT_eX]

[DOI]

Proceedings of the Computational Science and Its Applications, 2004

Proportional-Integral-Derivative Controllers Tuning for Unstable and Integral Processes Using Genetic Algorithms.

[BibT_eX]

[DOI]

Marco Antonio Paz-Ramos

Enrique Quintero-Marmol-Marquez

Proceedings of the Computational Science, 2004

Improving the Performance of a Genetic Algorithm Using a Variable-Reordering Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation, 2004

PID Controller Tuning for Stable and Unstable Processes Applying GA.

[BibT_eX]

[DOI]

Marco Antonio Paz-Ramos

Enrique Quintero-Marmol-Marquez

Hugo Estrada-Esquivel

Proceedings of the Genetic and Evolutionary Computation, 2004

Computation of Ternary Covering Arrays Using a Grid.

[BibT_eX]

[DOI]

Carlos de Alfonso

Proceedings of the Applied Computing, Second Asian Applied Computing Conference, 2004

2003

Heuristic Methods for Portfolio Selection at the Mexican Stock Exchange.

[BibT_eX]

[DOI]

Cesar A. Coutino-Gomez

Brenda M. Villarreal-Antelo

Proceedings of the Intelligent Data Engineering and Automated Learning, 2003

Routing of Embryonic Arrays Using Genetic Algorithms.

[BibT_eX]

[DOI]

Cesar Ortega-Sanchez

Jorge Morales-Cruz

Proceedings of the Evolvable Systems: From Biology to Hardware, 2003

ERA: An Algorithm for Reducing the Epistasis of SAT Problems.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation, 2003

2002

Data Integration Using the MONIL Language.

[BibT_eX]

Proceedings of the ICEIS 2002, 2002

2000

A New Measure for the Bandwidth Minimization Problem.

[BibT_eX]

[DOI]

Proceedings of the Advances in Artificial Intelligence, 2000

A Genetic Algorithms for Matrix Bandwith Reduction.

[BibT_eX]