Advanced search

Loading...

Advanced search    

Search: authors:"Jose Torres-Jimenez"

4 papers found.
Use AND, OR, NOT, +word, -word, "long phrase", (parentheses) to fine-tune your search.

A Simulated Annealing Algorithm to Construct Covering Perfect Hash Families

Correspondence should be addressed to Jose Torres-Jimenez; xm.vatsevnic@jtj Received 27 January 2018; Accepted 29 May 2018; Published 26 July 2018 Academic Editor: Fiorenzo A. Fazzolari Copyright © 2018 Jose ... Torres-Jimenez and Idelfonso Izquierdo-Marquez. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in

Optimal shortening of uniform covering arrays

not been published nor simultaneously submitted elsewhere, and c) we have acknowledged all entities that have funded this work in any way. Formal analysis: Jose Torres-Jimenez, Nelson Rangel-Valdez. 41 ... / 44 Writing ± original draft: Jose Torres-Jimenez, Himer Avila-George, Oscar Carrizalez Turrubiates. Writing ± review & editing: Jose Torres-Jimenez, Nelson Rangel-Valdez, Himer Avila George

New Bounds for Ternary Covering Arrays Using a Parallel Simulated Annealing

A covering array (CA) is a combinatorial structure specified as a matrix of N rows and k columns over an alphabet on v symbols such that for each set of t columns every t-tuple of symbols is covered at least once. Given the values of t, k, and v, the optimal covering array construction problem (CAC) consists in constructing a CA (N; t, k, v) with the minimum possible value of N...