Results 11 to 20 of about 3,122,051 (263)

Transformations for Energy Efficient Accelerated Chain Matrix Multiplication (TEE-ACM 2)

open access: yes, 2022
GPU matrix chain multiplication serves as a basis for a wide range of scientific domains like computer graphics, physics, and machine learning. While its time performance was studied for years, there has been significantly less effort in optimizing its energy efficiency.
Moraru, Maxim   +10 more
core   +6 more sources

The scheduling of sparse matrix-vector multiplication on a massively parallel dap computer [PDF]

open access: yes, 1991
An efficient data structure is presented which supports general unstructured sparse matrix-vector multiplications on a Distributed Array of Processors (DAP). This approach seeks to reduce the inter-processor data movements and organises the operations in
Mitra, G, Parkinson, D, Andersen, J
core   +6 more sources

Algorithms for matrix multiplication via sampling and opportunistic matrix multiplication [PDF]

open access: yes, 2023
Karppa & Kaski (2019) proposed a novel ``broken or ``opportunistic matrix multiplication algorithm, based on a variant of Strassen\u27s algorithm, and used this to develop new algorithms for Boolean matrix multiplication, among other tasks.
Harris, David G.
core   +2 more sources

Identification of the Critical Enablers for Perishable Food Supply Chain Using Deterministic Assessment Models

open access: yesApplied Sciences, 2022
Today’s perishable food supply chains must be resilient to handle volatile demands, environmental restrictions, and disruptions in order to meet customers’ requirements. The enablers of the perishable food supply chain have not yet been explored. In this
Malleswari Karanam   +4 more
doaj   +1 more source

Matrix Chain Multiplication and Polygon Triangulation Revisited and Generalized

open access: yesCoRR, 2021
The {\it matrix-chain multiplication} problem is a classic problem that is widely taught to illustrate dynamic programming. The textbook solution runs in $θ(n^3)$ time. However, there is a complex $O(n \log n)$-time method \cite{HU82}, based on triangulating convex polygons, and a description without proofs or implementation detail, of a much simpler ...
Thong Le, Dan Gusfield
openaire   +3 more sources

On Multiplicative Matrix Channels over Finite Chain Rings [PDF]

open access: yesJournal of Communication and Information Systems, 2013
23 pages, 4 ...
Roberto Wanderley da Nóbrega   +3 more
openaire   +4 more sources

Modeling the Quality Enablers of Supplier Chain Quality Management

open access: yesSAGE Open, 2022
It is essential to effectively integrate supply chain management and quality management, but a quality chain of suppliers and customers is a complex system relationship that remains poorly understood.
Jih-Kuang Chen, Tseng-Chan Tseng
doaj   +1 more source

An analysis of critical success factors towards sustainable supply chain management – in the context of an engine manufacturing industry

open access: yesInternational Journal of Sustainable Engineering, 2021
Appropriate consideration and selection of practices, success factors are of utmost importance of the best use of resources, time and money to facilitate Sustainable Supply Chain Management (SSCM) development.
Nikkhil Pandey   +2 more
doaj   +1 more source

Risk Path Identification and Research of Digital Trade Enterprises Based on the DEMATEL-ISM-MICMAC Model [PDF]

open access: yesSHS Web of Conferences, 2023
As the world ’s largest trading country, it is very important to ensure the stable operation of digital trading enterprises in the digital economy. Therefore, it is necessary to study the identification and influence path of risk factors.
Lv Haofeng
doaj   +1 more source

Finding a heaviest vertex-weighted triangle is not harder than matrix multiplication [PDF]

open access: yes, 2009
We show that a maximum-weight triangle in an undirected graph with n vertices and real weights assigned to vertices can be found in time O(n(omega) + n(2+o(1))), where omega is the exponent of the fastest matrix multiplication algorithm. By the currently
Lingas, Andrzej,   +4 more
core   +1 more source

Home - About - Disclaimer - Privacy