The following pages link to Idelfonso Izquierdo-Marquez (Q519758):
Displaying 11 items.
- A two-stage algorithm for combinatorial testing (Q519759) (← links)
- A dual representation simulated annealing algorithm for the bandwidth minimization problem on graphs (Q528766) (← links)
- Covering arrays of strength three from extended permutation vectors (Q1791674) (← links)
- New covering array numbers (Q2010732) (← links)
- A greedy-metaheuristic 3-stage approach to construct covering arrays (Q2198200) (← links)
- Improved covering arrays using covering perfect hash families with groups of restricted entries (Q2287570) (← links)
- Tower of covering arrays (Q2352791) (← links)
- Construction of non-isomorphic covering arrays (Q3178165) (← 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)
