2703 search results - page 307 / 541 » Optimizing memory transactions |
171
click to vote
TJS
2002
15 years 3 months ago
2002
Historically, compilers have operated by applying a fixed set of optimizations in a predetermined order. We call such an ordered list of optimizations a compilation sequence. This...
166
click to vote
PRL
2007
15 years 3 months ago
2007
: We propose a new feature selection strategy based on rough sets and Particle Swarm Optimization (PSO). Rough sets has been used as a feature selection method with much success, b...
129
click to vote
MOBIHOC
2010
ACM
15 years 1 months ago
2010
ACM
Recent years have witnessed the emergence of shared sensor networks as integrated infrastructure for multiple applications. It is important to allocate multiple applications in a ...
182
click to vote
PPOPP
2009
ACM
16 years 4 months ago
2009
ACM
GPGPUs have recently emerged as powerful vehicles for generalpurpose high-performance computing. Although a new Compute Unified Device Architecture (CUDA) programming model from N...
130
click to vote
EMSOFT
2007
Springer
15 years 10 months ago
2007
Springer
Most recent embedded systems use caches to improve their average performance. Current timing analyses are able to compute safe timing guarantees for these systems, if tasks are ru...