Skip to search formSkip to main contentSkip to account menu

Addressing mode

Known as: Indirect addressing, Load Effective Address, Indirect address 
Addressing modes are an aspect of the instruction set architecture in most central processing unit (CPU) designs. The various addressing modes that… 
Wikipedia

Related topics

Related topics

48 relations
ARM architectureAccumulator (computing)Advanced Vector ExtensionsAdventure

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
Variants of Dynamic Mode Decomposition: Boundary Condition, Koopman, and Fourier Analyses
Dynamic mode decomposition (DMD) is an Arnoldi-like method based on the Koopman operator. It analyzes empirical data, typically… 
Review
2008
Review
2008
Health services research
DL-FENFLURAMINE AND PHENTERMINE USE IN OBESE ADOLESCENTS: THE RELATIONSHIP BETWEEN AGE AND TREATMENT SUCCESS. SL Emerson_ CM… 
Highly Cited
2000
Highly Cited
2000
CommBench-a telecommunications benchmark for network processors
The paper presents a benchmark, CommBench, for use in evaluating and designing telecommunications network processors. The… 
Highly Cited
1999
Highly Cited
1999
Addressing first- and second-order barriers to change: Strategies for technology integration
Although teachers today recognize the importance of integrating technology into their curricula, efforts are often limited by… 
Highly Cited
1999
Highly Cited
1999
A combined unifrontal/multifrontal method for unsymmetric sparse matrices
We discuss the organization of frontal matrices in multifrontal methods for the solution of large sparse sets of unsymmetric… 
Highly Cited
1999
Highly Cited
1999
Addressing complications of intention-to-treat analysis in the combined presence of all-or-none treatment-noncompliance and subsequent missing outcomes
SUMMARY We study the combined impact that all-or-none compliance and subsequent missing outcomes can have on the estimation of… 
Highly Cited
1993
Highly Cited
1993
Fast parallel algorithms for short-range molecular dynamics
Abstract Three parallel algorithms for classical molecular dynamics are presented. The first assigns each processor a fixed… 
Highly Cited
1991
Highly Cited
1991
An Unsymmetric-Pattern Multifrontal Method for Sparse LU Factorization
Sparse matrix factorization algorithms for general problems are typically characterized by irregular memory access patterns that… 
Highly Cited
1984
Highly Cited
1984
Implementing Linear Algebra Algorithms for Dense Matrices on a Vector Pipeline Machine
This paper examines common implementations of linear algebra algorithms, such as matrix-vector multiplication, matrix-matrix… 
Highly Cited
1970
Highly Cited
1970
An efficient context-free parsing algorithm
A parsing algorithm which seems to be the most efficient general context-free algorithm known is described. It is similar to both… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License