Results 31 to 40 of about 23,727,129 (258)
Crop Journal, 2020 Owing to high power and accuracy and low false positive rate in our multi-locus approaches for genome-wide association studies and linkage analyses, these approaches have attracted considerable attention in plant and animal genetics.
Yangjun Wen +4 more
doaj +1 more source
When Are Cache-Oblivious Algorithms Cache Adaptive? A Case Study of Matrix Multiplication and Sorting [PDF]
, 2022 Cache-adaptive algorithms are a class of algorithms that achieve optimal utilization of dynamically changing memory. These memory fluctuations are the norm in today’s multi-threaded shared-memory machines and time-sharing caches. Bender et al.
Nithyanand, Rishab +7 more
core +1 more source
Randomized Matrix Decompositions Using R
Journal of Statistical Software, 2019 Matrix decompositions are fundamental tools in the area of applied mathematics, statistical computing, and machine learning. In particular, low-rank matrix decompositions are vital, and widely used for data analysis, dimensionality reduction, and data ...
N. Benjamin Erichson +3 more
doaj +1 more source
Optimisation of constant matrix multiplication operation hardware using a genetic algorithm [PDF]
, 2006 The efficient design of multiplierless implementations of constant matrix multipliers is challenged by the huge solution search spaces even for small scale problems.
O'Connor, Noel E. +6 more
core +2 more sources
Diagonal Loading Beamforming Based on Aquila Optimizer
IEEE Access, 2023 Traditional beamforming algorithms are only applicable to ideal environments. When the array antenna receives data under circumstances of small snapshots or large signal-to-noise ratio(SNR), noise eigenvalues of classic sample matrix inversion(SMI) and ...
Chao Liu, Jiaqi Zhen
doaj +1 more source
A New Parallel Matrix Multiplication Method Adapted on Fibonacci Hypercube Structure [PDF]
Journal of Sciences, Islamic Republic of Iran, 2010 The objective of this study was to develop a new optimal parallel algorithm for matrix multiplication which could run on a Fibonacci Hypercube structure. Most of the popular algorithms for parallel matrix multiplication can not run on Fibonacci Hypercube
L Jokar
doaj
A new Approach for the Modulus-Based Matrix Splitting Algorithms
IEEE Access, 2019 We investigate the modulus-based matrix splitting iteration algorithms for solving the linear complementarity problems (LCPs) and propose a new model to solve it.
Wenpeng Wang +3 more
doaj +1 more source
IEEE Access, 2021 Two M-decomposed based identification algorithms are proposed for large-scale systems in this study. Since the least squares algorithms involve matrix inversion calculation, they can be inefficient for large-scale systems whose information matrices are ...
Yuejiang Ji, Lixin Lv
doaj +1 more source
Non-negative Matrix Factorization for Dimensionality Reduction [PDF]
ITM Web of Conferences, 2022 —What matrix factorization methods do is reduce the dimensionality of the data without losing any important information. In this work, we present the Non-negative Matrix Factorization (NMF) method, focusing on its advantages concerning other methods of ...
Olaya Jbari, Otman Chakkor
doaj +1 more source
Project schedule optimisation utilising genetic algorithms [PDF]
, 2007 This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.This thesis extends the body of research into the application of Genetic Algorithms to the Project Scheduling Problem (PSP). A thorough literature review is
Lancaster, John
core +6 more sources