Results 281 to 290 of about 113,652 (316)
Some of the next articles are maybe not open access.
Improved block rearrangement algorithm
Annals of Operations Research, 2023Carole Bernard +3 more
openaire +2 more sources
A heuristic for blocking flow algorithms
European Journal of Operational Research, 1996zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
New random block cipher algorithm
2017 International Conference on Current Research in Computer Science and Information Technology (ICCIT), 2017This paper proposed a new secret key random block cipher as a candidate for Reaction Automata Direct Graph (RADG method). A new secret key consists of a 64-bit block size and a 128-bit key length. A new algorithm based in design on Generalized Unbalanced Feistel Network and uses a new S-boxes generated from a DES S-boxes, a bijective F function ...
Salah A. K. Albermany +2 more
openaire +1 more source
PoLABACK: parallel factorization algorithms with algorithmic blocking
Proceedings Fourth International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region, 2000Since parallel computers have different performance ratios of computation and communication, the optimal computational block sizes are different from one another to generate the maximum performance of an algorithm. Too small or large a block size makes getting good performance on a machine nearly impossible. In such a case, getting a better performance
openaire +1 more source
IEEE International Conference on Acoustics Speech and Signal Processing, 1993
A novel IIR algorithm based on a block implementation method is presented. This algorithm has two stages. First, a circular convolution is used to transform the input into intermediate results. Second, a correction circuit transforms the intermediate result into the correct output.
C.-M. Wu +3 more
openaire +1 more source
A novel IIR algorithm based on a block implementation method is presented. This algorithm has two stages. First, a circular convolution is used to transform the input into intermediate results. Second, a correction circuit transforms the intermediate result into the correct output.
C.-M. Wu +3 more
openaire +1 more source
Algorithms on block-complete graphs
1991Graphs whose blocks are complete subgraphs are said to be block-complete graphs. Polynomial time algorithms to solve several problems, problems which are not believed to be polynomial for general graphs, are presented for connected block-complete graphs.
Zhuguo Mo, Kenneth Williams
openaire +1 more source
A distance-based block searching algorithm.
Proceedings. International Conference on Intelligent Systems for Molecular Biology, 1995We present in this paper an algorithm for the multiple comparison of a set of protein sequences. Our approach is that of peptide matching and consists in looking for all the words that occur approximatively in at least q of the sequences in the set, where q is a parameter.
Sagot, M-F., Viari, Alain, Soldano, H.
openaire +2 more sources
An adaptive block Lanczos algorithm
Numerical Algorithms, 1996The paper is devoted to a generalization of the block Lanczos algorithm for a symmetric matrix, which allows the block size to be increased during the iterative process. In particular, the algorithm can be implemented with the block size chosen adaptively according to the clustering of Ritz values.
openaire +1 more source