Sciweavers

3616 search results - page 44 / 724
» Conditional Memory Ordering
Sort
View
CHI
2009
ACM
16 years 4 months ago
Remembrance of things tagged: how tagging effort affects tag production and human memory
We developed a low-effort interaction method called Click2Tag for social bookmarking. Information foraging theory predicts that the production of tags will increase as the effort ...
Raluca Budiu, Peter Pirolli, Lichan Hong
ATS
2009
IEEE
185views Hardware» more  ATS 2009»
15 years 11 months ago
Customized Algorithms for High Performance Memory Test in Advanced Technology Node
Embedded memory quality is critical to overall chip quality. New defect mechanisms that occur at advanced process nodes (65nm and below) are often more pronounced in memories due ...
Shomo Chen, Ning Huang, Ting-Pu Tai, Actel Niu
132
Voted
ISSS
1996
IEEE
114views Hardware» more  ISSS 1996»
15 years 8 months ago
Flow Graph Balancing for Minimizing the Required Memory Bandwidth
In this paper we present the problem of flow graph balancing for minimizingthe required memory bandwidth. Our goal is to minimize the required memory bandwidth within the given cy...
Sven Wuytack, Francky Catthoor, Gjalt G. de Jong, ...
SCAM
2007
IEEE
15 years 10 months ago
On Temporal Path Conditions in Dependence Graphs
Program dependence graphs are a well-established device to represent possible information flow in a program. Path conditions in dependence graphs have been proposed to express mo...
Andreas Lochbihler, Gregor Snelting
ATVA
2008
Springer
102views Hardware» more  ATVA 2008»
15 years 6 months ago
Time-Progress Evaluation for Dense-Time Automata with Concave Path Conditions
The evaluation of successor or predecessor state spaces through time progress is a central component in the model-checking algorithm of dense-time automata. The definition of the t...
Farn Wang