Skip to search formSkip to main contentSkip to account menu

Random-access stored-program machine

Known as: Random access program machine, RASP machine, RASP 
In theoretical computer science the random-access stored-program (RASP) machine model is an abstract machine used for the purposes of algorithm… 
Wikipedia (opens in a new tab)

Related topics

Related topics

19 relations
Abstract machineAccumulator (computing)AlgorithmAndrey Ershov

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Dynamic Random-Access Stored-Program Machine for Runtime Code Modification
  • J. Rudy
  • Int. J. Found. Comput. Sci.
  • 2015
  • Corpus ID: 9963973
This paper is concerned with the study of possibility of performing changes to existing running programs with the use of the RAM… 
Highly Cited
2014
Highly Cited
2014
Building Confidential and Efficient Query Services in the Cloud with RASP Data Perturbation
With the wide deployment of public cloud computing infrastructures, using clouds to host data query services has become an… 
Highly Cited
2009
Highly Cited
2009
Reliable a Priori Shortest Path Problem with Limited Spatial and Temporal Dependencies
This paper studies the problem of finding most reliable a priori shortest paths (RASP) in a stochastic and time-dependent network… 
Highly Cited
2007
Highly Cited
2007
Wide-Coverage Efficient Statistical Parsing with CCG and Log-Linear Models
This article describes a number of log-linear parsing models for an automatically extracted lexicalized grammar. The models are… 
Highly Cited
2006
Highly Cited
2006
The Second Release of the RASP System
We describe the new release of the RASP (robust accurate statistical parsing) system, designed for syntactic annotation of free… 
2005
2005
Computational complexity of random access stored program machines
  • J. Hartmanis
  • Mathematical systems theory
  • 2005
  • Corpus ID: 21594815
In this paper we explore the computational complexity measure defined by running times of programs on random access stored… 
Highly Cited
2005
Highly Cited
2005
Privacy preserving data classification with rotation perturbation
  • Keke Chen, Ling Liu
  • Fifth IEEE International Conference on Data…
  • 2005
  • Corpus ID: 6277564
Data perturbation techniques are one of the most popular models for privacy preserving data mining (Agrawal and Srikant, 2000… 
Highly Cited
2005
Highly Cited
2005
Simplified two-dimensional numerical modelling of coastal flooding and example applications
Highly Cited
2004
Highly Cited
2004
Characterising Measures of Lexical Distributional Similarity
This work investigates the variation in a word's distributionally nearest neighbours with respect to the similarity measure used… 
Highly Cited
1964
Highly Cited
1964
Random-Access Stored-Program Machines, an Approach to Programming Languages
A new class of machine models as a framework for the rational discussion of programming languages is introduced. In particular, a… 
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)