Add to ORKGAbstract. Orthogonal array is an interesting notation in Mathematic and Design of Experiment. Of which, enumerating orthogonal arrays of strength t is also an important issue. So far some methods have been proposed for enumerating orthogonal arrays of strength t, however parallelize methods for this purpose still haven’t been investigated. For this purpose, this paper will present an efficient parallel method for enumerating orthogonal arrays of strength t based on a serial backtrack search method. This method was implemented utilizing MPI and executed on the Supernode II cluster of HoChiMinh City University of Technology (HCMUT), Vietnam. Initial experiment results of the parallelization yields good speedups, efficiency ratios
Test generation for combinational circuits is an important step in the VLSI design process. Unfortun...
We present two generic parallel skeletons for the tabu search method-a well known meta-heuristic for...
Parallel parenthesis-matching algorithm has in the past been used to design parallel algorithms for ...
Submission note: A thesis submitted in total fulfilment of the requirements for the degree of Doctor...
In this paper we present an algorithm for parallel exhaustive search for short vectors in lattices. ...
Abstract. Lattice basis reduction is the problem of finding short vec-tors in lattices. The security...
Abstract. Orthogonal arrays (OAs) are basic combinatorial structures, originally studied by statisti...
[[abstract]]The authors present a parallel algorithm to generate the permutations of at most k out o...
Orthogonal arrays are frequently used in industrial experi-ments for quality and productivity improv...
In this paper we present two parallel skeletons for Tabu Search method -- a well known meta-heuristi...
This paper describes the construction and enumeration of mixed orthogonal arrays (MOA) to produce op...
In this thesis a parallel algorithm for determining the zeros of any given analytic function is desc...
Abstract: The paper considers a development of approach to construction of parallel algori...
The paper presents two parallel algorithms for finding the rank of a rectangular matrix and two para...
It is only in the last five years that researchers have begun to use disk-based search techniques on...
Test generation for combinational circuits is an important step in the VLSI design process. Unfortun...
We present two generic parallel skeletons for the tabu search method-a well known meta-heuristic for...
Parallel parenthesis-matching algorithm has in the past been used to design parallel algorithms for ...
Submission note: A thesis submitted in total fulfilment of the requirements for the degree of Doctor...
In this paper we present an algorithm for parallel exhaustive search for short vectors in lattices. ...
Abstract. Lattice basis reduction is the problem of finding short vec-tors in lattices. The security...
Abstract. Orthogonal arrays (OAs) are basic combinatorial structures, originally studied by statisti...
[[abstract]]The authors present a parallel algorithm to generate the permutations of at most k out o...
Orthogonal arrays are frequently used in industrial experi-ments for quality and productivity improv...
In this paper we present two parallel skeletons for Tabu Search method -- a well known meta-heuristi...
This paper describes the construction and enumeration of mixed orthogonal arrays (MOA) to produce op...
In this thesis a parallel algorithm for determining the zeros of any given analytic function is desc...
Abstract: The paper considers a development of approach to construction of parallel algori...
The paper presents two parallel algorithms for finding the rank of a rectangular matrix and two para...
It is only in the last five years that researchers have begun to use disk-based search techniques on...
Test generation for combinational circuits is an important step in the VLSI design process. Unfortun...
We present two generic parallel skeletons for the tabu search method-a well known meta-heuristic for...
Parallel parenthesis-matching algorithm has in the past been used to design parallel algorithms for ...
