The following pages link to Jose Torres-Jimenez (Q337398):
Displayed 37 items.
- A grouping genetic algorithm with controlled gene transmission for the bin packing problem (Q337402) (← links)
- A two-stage algorithm for combinatorial testing (Q519759) (← links)
- A dual representation simulated annealing algorithm for the bandwidth minimization problem on graphs (Q528766) (← links)
- Cover starters for covering arrays of strength two (Q764881) (← links)
- (Q1628612) (redirect page) (← links)
- Homotopy perturbation transform method for nonlinear differential equations involving to fractional operator with exponential kernel (Q1628614) (← links)
- Covering arrays of strength three from extended permutation vectors (Q1791674) (← links)
- Nonlocal transport processes and the fractional Cattaneo-Vernotte equation (Q1793571) (← links)
- New covering array numbers (Q2010732) (← links)
- Dynamical aspects of a delayed epidemic model with subdivision of susceptible population and control strategies (Q2113015) (← links)
- A greedy-metaheuristic 3-stage approach to construct covering arrays (Q2198200) (← links)
- A greedy algorithm to construct covering arrays using a graph representation (Q2201668) (← links)
- Covering array EXtender (Q2242769) (← links)
- Improved covering arrays using covering perfect hash families with groups of restricted entries (Q2287570) (← links)
- Tower of covering arrays (Q2352791) (← links)
- An improved simulated annealing algorithm for bandwidth minimization (Q2464218) (← links)
- An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem (Q2482382) (← links)
- Construction of mixed covering arrays using a combination of simulated annealing and variable neighborhood search (Q2631238) (← links)
- A Simulated Annealing with Variable Neighborhood Search Approach to Construct Mixed Covering Arrays (Q2840782) (← links)
- MiTS in Depth: An Analysis of Distinct Tabu Search Configurations for Constructing Mixed Covering Arrays (Q2866118) (← links)
- (Q3000893) (← links)
- An algorithm to compute integer ηth roots using subtractions (Q3008371) (← links)
- Construction of Mixed Covering Arrays of Variable Strength Using a Tabu Search Approach (Q3066144) (← links)
- Construction of logarithm tables for Galois Fields (Q3069685) (← links)
- CONSTRUCTION OF MIXED COVERING ARRAYS OF STRENGTHS 2 THROUGH 6 USING A TABU SEARCH APPROACH (Q3166745) (← links)
- Construction of non-isomorphic covering arrays (Q3178165) (← links)
- (Q4418731) (← links)
- (Q4449705) (← links)
- Analysis of x-ray diffraction data using a hybrid stochastic optimization method (Q4465663) (← links)
- (Q4471904) (← links)
- <i>hClique</i>: An exact algorithm for maximum clique problem in uniform hypergraphs (Q4597964) (← links)
- New optimal covering arrays using an orderly algorithm (Q4603878) (← links)
- A low spatial complexity algorithm to generate combinations with the strong minimal change property (Q5242834) (← links)
- Near-optimal algorithm to count occurrences of subsequences of a given length (Q5367537) (← links)
- Computational Science - ICCS 2004 (Q5712660) (← links)
- Cartesian product of sets without repeated elements (Q6092041) (← links)
- Stability analysis of Atangana–Baleanu fractional stochastic differential systems with impulses (Q6099309) (← links)