Sciweavers

1882 search results - page 235 / 377
» Transformational Programming and Forests
Sort
View
135
Voted
ORL
2007
49views more  ORL 2007»
15 years 5 months ago
Lot sizing with inventory gains
This paper introduces the single item lot sizing problem with inventory gains. This problem is a generalization of the classical single item capacitated lot sizing problem to one ...
Hamish Waterer
SAS
2010
Springer
143views Formal Methods» more  SAS 2010»
15 years 4 months ago
Points-to Analysis as a System of Linear Equations
The efficiency of a points-to analysis is critical for several compiler optimizations and transformations, and has attracted considerable research attention. Despite several advanc...
Rupesh Nasre, Ramaswamy Govindarajan
TCC
2007
Springer
142views Cryptology» more  TCC 2007»
16 years 7 days ago
On Best-Possible Obfuscation
An obfuscator is a compiler that transforms any program (which we will view in this work as a boolean circuit) into an obfuscated program (also a circuit) that has the same input-...
Shafi Goldwasser, Guy N. Rothblum
LCPC
2005
Springer
15 years 11 months ago
Supporting SELL for High-Performance Computing
We briefly introduce the notion of Semantically Enhanced Library Languages, SELL, as a practical and economical alternative to special-purpose programming languages for high-perfo...
Bjarne Stroustrup, Gabriel Dos Reis
217
Voted
POPL
1994
ACM
15 years 10 months ago
Formally Optimal Boxing
An important implementation decision in polymorphically typed functional programming languages is whether to represent data in boxed or unboxed form and when to transform them fro...
Fritz Henglein, Jesper Jørgensen