Sciweavers

2555 search results - page 144 / 511
» Quantifiers and Working Memory
Sort
View
121
Voted
PLDI
2006
ACM
15 years 9 months ago
Free-Me: a static analysis for automatic individual object reclamation
Garbage collection has proven benefits, including fewer memoryrelated errors and reduced programmer effort. Garbage collection, however, trades space for time. It reclaims memory...
Samuel Z. Guyer, Kathryn S. McKinley, Daniel Framp...
ICML
2008
IEEE
16 years 4 months ago
The projectron: a bounded kernel-based Perceptron
We present a discriminative online algorithm with a bounded memory growth, which is based on the kernel-based Perceptron. Generally, the required memory of the kernelbased Percept...
Francesco Orabona, Joseph Keshet, Barbara Caputo
CC
2009
Springer
153views System Software» more  CC 2009»
16 years 4 months ago
Register Spilling and Live-Range Splitting for SSA-Form Programs
Register allocation decides which parts of a variable's live range are held in registers and which in memory. The compiler inserts spill code to move the values of variables b...
Matthias Braun, Sebastian Hack
105
Voted
TPHOL
2009
IEEE
15 years 10 months ago
Types, Maps and Separation Logic
Abstract. This paper presents a separation-logic framework for reasoning about low-level C code in the presence of virtual memory. We describe ract, generic Isabelle/HOL framework ...
Rafal Kolanski, Gerwin Klein
IPPS
2008
IEEE
15 years 10 months ago
Automatic generation of a parallel sorting algorithm
In this paper, we discuss a library generator for parallel sorting routines that examines the input characteristics (and the parameters they affect) to select the best performing ...
Brian A. Garber, Daniel Hoeflinger, Xiaoming Li, M...