Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,369,705 papers from all fields of science
Search
Sign In
Create Free Account
Call stack
Known as:
Runtime stack
, Function stack
, Display register
Expand
In computer science, a call stack is a stack data structure that stores information about the active subroutines of a computer program. This kind of…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
Aliasing (computing)
C dynamic memory allocation
C standard library
CHICKEN Scheme
Expand
Broader (1)
Memory management
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
A Large-Signal and Dynamic Circuit Model of a $\hbox{H}_{2}/\hbox{O}_{2}$ PEM Fuel Cell: Description, Parameter Identification, and Exploitation
G. Fontès
,
C. Turpin
,
S. Astier
IEEE transactions on industrial electronics…
2010
Corpus ID: 22450898
The authors propose a large-signal and dynamic circuit model for a proton exchange membrane fuel cell, which includes the…
Expand
Highly Cited
2010
Highly Cited
2010
Robust Transmission and Interference Management For Femtocells with Unreliable Network Access
O. Simeone
,
E. Erkip
,
S. Shamai
IEEE Journal on Selected Areas in Communications
2010
Corpus ID: 12402477
A cellular system where macrocells are overlaid with femtocells is studied. Each femtocell is served by a home base station (HBS…
Expand
2009
2009
Control of insect pests under ware-house conditions using smoke generated from partial combustion of rice (paddy) husk
L. Wijayaratne
,
M. Fernando
,
K. B. Palipane
2009
Corpus ID: 13881980
Adult Sitophilus oryzae and Rhyzopertha dominica , two major devastating insect pests of stored paddy in Sri Lanka, included in…
Expand
2008
2008
Software Implemented Detection and Recovery of Soft Errors in a Brake-by-Wire System
D. Skarin
,
J. Karlsson
Seventh European Dependable Computing Conference
2008
Corpus ID: 17385588
This paper presents an experimental study of the impact of soft errors in a prototype brake-by-wire system. To emulate the…
Expand
Highly Cited
2006
Highly Cited
2006
Measured TCP Performance in CDMA 1x EV-DO Network?
Youngseok Lee
2006
Corpus ID: 16278666
A horn antenna is disclosed having a built-in circular polarizer and a cross polarization attenuator. A square-apertured horn…
Expand
2006
2006
Avoiding Infinite Recursion with Stratified Aspects
E. Bodden
,
Florian Forster
,
F. Steimann
NODe/GSEM
2006
Corpus ID: 11533450
Abstract: Infinite recursion is a known problem of aspect-oriented programming with AspectJ: if no special precautions are taken…
Expand
1998
1998
Solving satisfiability problems using logic synthesis and reconfigurable hardware
Takayuki Suyama
,
M. Yokoo
,
Hiroshi Sawada
Proceedings of the Thirty-First Hawaii…
1998
Corpus ID: 8098636
This paper presents new results on an approach for solving satisfiability problems (SAT), i.e. creating a logic circuit that is…
Expand
Highly Cited
1996
Highly Cited
1996
Empirical model of WWW document arrivals at access link
S. Deng
International Conference on Communications
1996
Corpus ID: 18707592
The cable and telephone industries have already begun constructing the information superhighway. The network capacity planning…
Expand
1993
1993
Diversity and automatic link transfer for a TDMA wireless access link
N. Sollenberger
Proceedings of GLOBECOM '93. IEEE Global…
1993
Corpus ID: 62377019
The paper describes diversity and automatic link transfer techniques which have been proposed for low-power digital wireless…
Expand
1967
1967
The IBM system/360 model 91: storage system
L. Boland
,
G. Granito
,
A. U. Marcotte
,
B. Messina
,
J. W. Smith
1967
Corpus ID: 56580626
This paper discusses the design concepts employed in the development of the IBM System/360 Model 91 storage system. Particular…
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