Jose Torres-Jimenez

Orcid: 0000-0002-5029-5340

Affiliations:
  • CINVESTAV Tamaulipas, Ciudad Victoria, Mexico


According to our database1, Jose Torres-Jimenez authored at least 97 papers between 1999 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Conflict recognition in CSCL sessions through the identification of cycles in conversational graphs.
Educ. Inf. Technol., September, 2023

2022
New upper bounds for sequence Covering Arrays using a 3-stage approach.
Expert Syst. Appl., 2022

2021
Cartesian product of sets without repeated elements.
Inf. Sci., 2021

Detecting conflicts in collaborative learning through the valence change of atomic interactions.
Expert Syst. Appl., 2021

Covering array EXtender.
Appl. Math. Comput., 2021

Three Representations for Set Partitions.
IEEE Access, 2021

2020
Improved covering arrays using covering perfect hash families with groups of restricted entries.
Appl. Math. Comput., 2020

2019
A greedy algorithm to construct covering arrays using a graph representation.
Inf. Sci., 2019

A low spatial complexity algorithm to generate combinations with the strong minimal change property.
Discret. Math. Algorithms Appl., 2019

New covering array numbers.
Appl. Math. Comput., 2019

Methods to Construct Uniform Covering Arrays.
IEEE Access, 2019

Wrapper for Building Classification Models Using Covering Arrays.
IEEE Access, 2019

2018
A greedy-metaheuristic 3-stage approach to construct covering arrays.
Inf. Sci., 2018

<i>Research Notes</i>: Binary Test-Suites Using Covering Arrays.
Int. J. Softw. Eng. Knowl. Eng., 2018

Search-based software engineering for constructing covering arrays.
IET Softw., 2018

Improved pairwise test suites for non-prime-power orders.
IET Softw., 2018

New optimal covering arrays using an orderly algorithm.
Discret. Math. Algorithms Appl., 2018

Covering arrays of strength three from extended permutation vectors.
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.
Appl. Soft Comput., 2018

A Proposal to Estimate the Variable Importance Measures in Predictive Models Using Results from a Wrapper.
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.
Proceedings of the Advances in Soft Computing, 2018

Mining Dynamic Network-Wide Traffic States.
Proceedings of the 21st International Conference on Intelligent Transportation Systems, 2018

2017
A graph-based postoptimization approach for covering arrays.
Qual. Reliab. Eng. Int., 2017

A two-stage algorithm for combinatorial testing.
Optim. Lett., 2017

<i>hClique</i>: An exact algorithm for maximum clique problem in uniform hypergraphs.
Discret. Math. Algorithms Appl., 2017

Near-optimal algorithm to count occurrences of subsequences of a given length.
Discret. Math. Algorithms Appl., 2017

Metaheuristic post-optimization of the NIST repository of covering arrays.
CAAI Trans. Intell. Technol., 2017

2016
Construction of non-isomorphic covering arrays.
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.
Proceedings of the Advances in Soft Computing, 2016

Clustering Business Process Models Based on Multimodal Search and Covering Arrays.
Proceedings of the Advances in Soft Computing, 2016

2015
Erratum to: Supercomputing and grid computing on the verification of covering arrays.
J. Supercomput., 2015

A dual representation simulated annealing algorithm for the bandwidth minimization problem on graphs.
Inf. Sci., 2015

Construction of Mixed Covering Arrays Using a Combination of Simulated Annealing and Variable Neighborhood Search.
Electron. Notes Discret. Math., 2015

A grouping genetic algorithm with controlled gene transmission for the bin packing problem.
Comput. Oper. Res., 2015

A Branch & Bound Algorithm to Derive a Direct Construction for Binary Covering Arrays.
Proceedings of the Advances in Artificial Intelligence and Soft Computing, 2015

Exciting FPGA cryptographic Trojans using combinatorial testing.
Proceedings of the 26th IEEE International Symposium on Software Reliability Engineering, 2015

Equivalence class verification and oracle-free testing using two-layer covering arrays.
Proceedings of the Eighth IEEE International Conference on Software Testing, 2015

2014
Characterization of the Optimization Process.
Proceedings of the Recent Advances on Hybrid Approaches for Designing Intelligent Systems, 2014

Applications of metaheuristics in real-life problems.
Prog. Artif. Intell., 2014

2013
A Genetic Algorithm for the Problem of Minimal Brauer Chains for Large Exponents.
Proceedings of the Soft Computing Applications in Optimization, Control, and Recognition, 2013

A Genetic Algorithm for the Problem of Minimal Brauer Chains.
Proceedings of the Recent Advances on Hybrid Intelligent Systems, 2013

Improving the Performance of Heuristic Algorithms Based on Exploratory Data Analysis.
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.
Proceedings of the Artificial Intelligence, Evolutionary Computing and Metaheuristics, 2013

SAT Model for the Curriculum-Based Course Timetabling Problem.
Res. Comput. Sci., 2013

Metaheuristic approach for constructing functional test-suites.
IET Softw., 2013

Survey of Covering Arrays.
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.
Proceedings of the Artificial Intelligence Research and Development, 2013

2012
Supercomputing and grid computing on the verification of covering arrays.
J. Supercomput., 2012

New bounds for binary covering arrays using simulated annealing.
Inf. Sci., 2012

A Simulated Annealing with Variable Neighborhood Search Approach to Construct Mixed Covering Arrays.
Electron. Notes Discret. Math., 2012

Construction of Mixed Covering Arrays of strengths 2 through 6 Using a Tabu Search Approach.
Discret. Math. Algorithms Appl., 2012

Cover starters for covering arrays of strength two.
Discret. Math., 2012

Heurísticas de agrupación híbridas eficientes para el problema.
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.
Proceedings of the Advances in Computational Intelligence, 2012

Constructing Real Test-Suites Using an Enhanced Simulated Annealing.
Proceedings of the Advances in Artificial Intelligence - IBERAMIA 2012, 2012

Simulated Annealing for Constructing Mixed Covering Arrays.
Proceedings of the Distributed Computing and Artificial Intelligence, 2012

2011
An algorithm to compute integer ηth roots using subtractions.
Int. J. Comput. Math., 2011

A Mutation-Selection Algorithm for the Problem of Minimum Brauer Chains.
Proceedings of the Advances in Soft Computing, 2011

Improving the Performance of Heuristic Algorithms Based on Causal Inference.
Proceedings of the Advances in Artificial Intelligence, 2011

An Exact Approach to Maximize the Number of Wild Cards in a Covering Array.
Proceedings of the Advances in Artificial Intelligence, 2011

Optimal Shortening of Covering Arrays.
Proceedings of the Advances in Artificial Intelligence, 2011

A Simulated Annealing Algorithm for the Problem of Minimal Addition Chains.
Proceedings of the Progress in Artificial Intelligence, 2011

2010
MiTS: A New Approach of Tabu Search for Constructing Mixed Covering Arrays.
Proceedings of the Advances in Soft Computing, 2010

Optimization of Investment Options Using SQL.
Proceedings of the Advances in Artificial Intelligence, 2010

A Heuristic Approach for Constructing Ternary Covering Arrays Using Trinomial Coefficients.
Proceedings of the Advances in Artificial Intelligence, 2010

Verification of General and Cyclic Covering Arrays Using Grid Computing.
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.
Proceedings of the Combinatorial Optimization and Applications, 2010

Simulated Annealing for constructing binary covering arrays of variable strength.
Proceedings of the IEEE Congress on Evolutionary Computation, 2010

2009
Phase Transition in the Bandwidth Minimization Problem.
Proceedings of the MICAI 2009: Advances in Artificial Intelligence, 2009

A New Backtracking Algorithm for Constructing Binary Covering Arrays of Variable Strength.
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.
Proceedings of the IJCCI 2009, 2009

Memetic Algorithms for Constructing Binary Covering Arrays of Strength Three.
Proceedings of the Artifical Evolution, 2009

2008
An improved simulated annealing algorithm for bandwidth minimization.
Eur. J. Oper. Res., 2008

An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem.
Comput. Oper. Res., 2008

Strength Two Covering Arrays Construction Using a SAT Representation.
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.
Proceedings of the Foundations of Intelligent Systems, 17th International Symposium, 2008

Symbolic Summation of Polynomials in Linear Space and Quadratic Time.
Proceedings of the International Symposium on Distributed Computing and Artificial Intelligence, 2008

2006
El Lenguaje MONIL, una Alternativa para la Integración de Datos.
Computación y Sistemas, 2006

A Refined Evaluation Function for the MinLA Problem.
Proceedings of the MICAI 2006: Advances in Artificial Intelligence, 2006

A Method for Software Architecture Design in the Aspect Oriented Development.
Proceedings of the JIISIC'06, 2006

Designing Aspectual Architecture Views in Aspect-Oriented Software Development.
Proceedings of the Computational Science and Its Applications, 2006

2005
A Comparison of Memetic Recombination Operators for the MinLA Problem.
Proceedings of the MICAI 2005: Advances in Artificial Intelligence, 2005

Memetic Algorithms for the MinLA Problem.
Proceedings of the Artificial Evolution, 2005

2004
An Improved Evaluation Function for the Bandwidth Minimization Problem.
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.
Proceedings of the ICEIS 2004, 2004

Using a Goal-Refinement Tree to Obtain and Refine Organizational Requirements.
Proceedings of the Computational Science and Its Applications, 2004

Proportional-Integral-Derivative Controllers Tuning for Unstable and Integral Processes Using Genetic Algorithms.
Proceedings of the Computational Science, 2004

Improving the Performance of a Genetic Algorithm Using a Variable-Reordering Algorithm.
Proceedings of the Genetic and Evolutionary Computation, 2004

PID Controller Tuning for Stable and Unstable Processes Applying GA.
Proceedings of the Genetic and Evolutionary Computation, 2004

Computation of Ternary Covering Arrays Using a Grid.
Proceedings of the Applied Computing, Second Asian Applied Computing Conference, 2004

2003
Heuristic Methods for Portfolio Selection at the Mexican Stock Exchange.
Proceedings of the Intelligent Data Engineering and Automated Learning, 2003

Routing of Embryonic Arrays Using Genetic Algorithms.
Proceedings of the Evolvable Systems: From Biology to Hardware, 2003

ERA: An Algorithm for Reducing the Epistasis of SAT Problems.
Proceedings of the Genetic and Evolutionary Computation, 2003

2002
Data Integration Using the MONIL Language.
Proceedings of the ICEIS 2002, 2002

2000
A New Measure for the Bandwidth Minimization Problem.
Proceedings of the Advances in Artificial Intelligence, 2000

A Genetic Algorithms for Matrix Bandwith Reduction.
Proceedings of the Genetic and Evolutionary Computation Conference (GECCO '00), 2000

1999
An Information System for Global Climatic Change Research Using MARC/FGDC Meta-data Standards (An Interinstitutional Project in México).
Proceedings of the 3rd IEEE Metadata Conference 1999, MD 1999, Bethesda, 1999


  Loading...