Sciweavers

2035 search results - page 341 / 407
» Working memory
Sort
View
ICS
2009
Tsinghua U.
15 years 6 months ago
Less reused filter: improving l2 cache performance via filtering less reused lines
The L2 cache is commonly managed using LRU policy. For workloads that have a working set larger than L2 cache, LRU behaves poorly, resulting in a great number of less reused lines...
Lingxiang Xiang, Tianzhou Chen, Qingsong Shi, Wei ...
CHARME
2001
Springer
133views Hardware» more  CHARME 2001»
15 years 4 months ago
View from the Fringe of the Fringe
Formal analysis remains outside the mainstream of system design practice. Interactive methods and tools are regarded by some to be on the margin of useful research in this area. Al...
Steven D. Johnson
AO
2005
147views more  AO 2005»
14 years 11 months ago
Domain modelling and NLP: Formal ontologies? Lexica? Or a bit of both?
There are a number of genuinely open questions concerning the use of domain models in nlp. It would be great if contributors to Applied Ontology could help addressing them rather ...
Massimo Poesio
GECCO
2009
Springer
103views Optimization» more  GECCO 2009»
15 years 6 months ago
Why evolution is not a good paradigm for program induction: a critique of genetic programming
We revisit the roots of Genetic Programming (i.e. Natural Evolution), and conclude that the mechanisms of the process of evolution (i.e. selection, inheritance and variation) are ...
John R. Woodward, Ruibin Bai
PLDI
2003
ACM
15 years 5 months ago
Compile-time composition of run-time data and iteration reorderings
Many important applications, such as those using sparse data structures, have memory reference patterns that are unknown at compile-time. Prior work has developed runtime reorderi...
Michelle Mills Strout, Larry Carter, Jeanne Ferran...