Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 233,328,659 papers from all fields of science
Search
Sign In
Create Free Account
Von Neumann architecture
Known as:
VNA
, Princeton architecture
, Non-Von Neumann architecture
Expand
The von Neumann architecture, which is also known as the von Neumann model and Princeton architecture, is a computer architecture based on that…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
49 relations
ACM Turing Award
ARM7
AVIDAC
Agent-based model
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
An explicit time evolution method for acoustic wave propagation
Huafeng Liu
,
N. Dai
,
F. Niu
,
Wei Wu
2014
Corpus ID: 58915639
Cost-effective waveform modeling is the key to practical reverse time migration (RTM) and full-waveform inversion (FWI…
Expand
2008
2008
GBP-WAHSN: A Group-Based Protocol for Large Wireless Ad Hoc and Sensor Networks
Jaime Lloret
,
Miguel Garcia
,
Jesús Tomás
,
F. Boronat
Journal of Computational Science and Technology
2008
Corpus ID: 11381155
Grouping nodes gives better performance to the whole network by diminishing the average network delay and avoiding unnecessary…
Expand
2004
2004
A novel highly reliable low-power nano architecture when von Neumann augments Kolmogorov
Valeriu Beiu
Proceedings. 15th IEEE International Conference…
2004
Corpus ID: 12096873
This work presents a novel architecture, which is both device and circuit independent. The starting idea is that computations can…
Expand
2004
2004
Software framework concepts for power distribution system analysis
Fangxing Li
,
Robert Broadwater
IEEE Transactions on Power Systems
2004
Corpus ID: 44547109
Software design reuse has been discussed in the past at the component level through Design Patterns. A software framework is an…
Expand
2002
2002
The Transition from Zeldovich-von Neumann-Doring to Chapman-Jouguet Theories for a Nonconvex Scalar Combustion Model
Jiequan Li
,
Peng Zhang
SIAM Journal on Mathematical Analysis
2002
Corpus ID: 207076634
We study the transition from the Zeldovich--von Neumann--Doring (ZND) theory to the Chapman--Jouguet (CJ) theory as the reaction…
Expand
2001
2001
A complete measurement Test-Set for non-linear device characterization
A. Ferrero
,
V. Teppati
58th ARFTG Conference Digest
2001
Corpus ID: 40014218
A novel test set which integrates an active load pull system with a VNA and a Time Domain receiver is presented. The system has…
Expand
Highly Cited
1994
Highly Cited
1994
Data-Procedural Languages for FPL-based Machines
A. Ast
,
J. Becker
,
R. Hartenstein
,
R. Kress
,
H. Reinig
,
K. Schmidt
International Conference on Field-Programmable…
1994
Corpus ID: 18055764
This paper introduces a new high level programming language for a novel class of computational devices namely data-procedural…
Expand
1993
1993
A data-parallel programming model for reconfigurable architectures
S. Guccione
,
Mario J. Gonzalez
[] Proceedings IEEE Workshop on FPGAs for Custom…
1993
Corpus ID: 61731976
Recently, several machines have been built using field programmable gate array (FPGA) technology. These reconfigurable…
Expand
1993
1993
Realising massively concurrent systems on the SPACE machine
G. Milne
,
Paul Cockshott
,
George McCaskill
,
P. Barrie
,
HardLab
[] Proceedings IEEE Workshop on FPGAs for Custom…
1993
Corpus ID: 61210122
Highly concurrent systems occur frequently in the physical world. This paper focuses on a class of systems characterised as being…
Expand
1986
1986
A Special-Function Unit for Sorting and Sort-Based Database Operations
L. Raschid
,
Tinghe Fei
,
H. Lam
,
S. Su
IEEE transactions on computers
1986
Corpus ID: 1998184
Achieving efficiency in database management functions is a fundamental problem underlying many computer applications. Efficiency…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE