Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,927,268 papers from all fields of science
Search
Sign In
Create Free Account
Memory bound function
Known as:
Memory bound
, Memory function
Memory bound refers to a situation in which the time to complete a given computational problem is decided primarily by the amount of memory required…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
21 relations
Algorithm
Computational problem
CryptoNote
Cynthia Dwork
Expand
Broader (2)
Analysis of algorithms
Computer memory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
CMOS supporting circuitries for nano-oscillator-based associative memories
T. Shibata
,
Renyuan Zhang
,
S. Levitan
,
D. Nikonov
,
G. Bourianoff
13th International Workshop on Cellular Nanoscale…
2012
Corpus ID: 16117126
“Let physics do computing” is a promising approach to new-paradigm computing in the beyond CMOS era. Building associative…
Expand
2012
2012
The fractional oscillator as an open system
V. E. Tarasov
2012
Corpus ID: 54012332
A dynamical system governed by equations with derivatives of non-integer order, such as the fractional oscillator, can be…
Expand
Highly Cited
2010
Highly Cited
2010
Fixed-Priority Multiprocessor Scheduling with Liu and Layland's Utilization Bound
Nan Guan
,
Martin Stigge
,
W. Yi
,
Ge Yu
16th IEEE Real-Time and Embedded Technology and…
2010
Corpus ID: 1599561
Liu and Layland discovered the famous utilization bound for fixed-priority scheduling on single processor systems in the 1970's…
Expand
2009
2009
A Guided Tour Puzzle for Denial of Service Prevention
M. Abliz
,
T. Znati
Asia-Pacific Computer Systems Architecture…
2009
Corpus ID: 14434713
Various cryptographic puzzle schemes are proposed as a defense mechanism against denial of service attack. But, all these puzzle…
Expand
Highly Cited
2008
Highly Cited
2008
A Dynamic Optically Reconfigurable Gate Array—Perfect Emulation
D. Seto
,
Minoru Watanabe
IEEE Journal of Quantum Electronics
2008
Corpus ID: 6174693
This paper presents a perfect dynamic optically reconfigurable gate array (DORGA) architecture emulation using a holographic…
Expand
2008
2008
Statistical quantifiers of memory for an analysis of human brain and neuro-system diseases
S. Demin
,
R. Yulmetyev
,
O. Panischev
,
P. Hänggi
2008
Corpus ID: 5662258
Highly Cited
2006
Highly Cited
2006
Load Balancing in a Cluster Computer
P. Werstein
,
Hailing Situ
,
Zhiyi Huang
International Conference on Parallel and…
2006
Corpus ID: 16349131
This paper proposes a load balancing algorithm for distributed use of a cluster computer. It uses load information including CPU…
Expand
Highly Cited
1998
Highly Cited
1998
Optimizing tabu list size for the traveling salesman problem
S. Tsubakitani
,
James R. Evans
Computers & Operations Research
1998
Corpus ID: 39877702
Highly Cited
1998
Highly Cited
1998
An efficient RMS admission control and its application to multiprocessor scheduling
Sylvain Lauzac
,
R. Melhem
,
D. Mossé
Proceedings of the First Merged International…
1998
Corpus ID: 820062
A real-time system must execute functionally correct computations in a timely manner. In order to guarantee that all tasks…
Expand
Highly Cited
1973
Highly Cited
1973
Electrophoretic image display (EPID) panel
I. Ota
,
J. Ohnishi
,
M. Yoshiyama
1973
Corpus ID: 62233572
A new reflective-type electrophoretic image display (EPID) panel is described which is based on electrophoresis. In the EPID…
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