2343 search results - page 178 / 469 » Structure and Interpretation of Computer Programs |
112
click to vote
LCPC
1993
Springer
15 years 9 months ago
1993
Springer
This paper presents a model for concurrent programming, where programs (concurrent program structures) are represented as composition expressions over component programs with suita...
139
click to vote
TAPSOFT
1995
Springer
15 years 8 months ago
1995
Springer
Abstract. Binding-time analyses based on flow analysis have been presented by Bondorf, Consel, Bondorf and Jørgensen, and Schwartzbach and the present author. The analyses are fo...
204
click to vote
ICLP
2003
Springer
15 years 10 months ago
2003
Springer
In recent research on nonmonotonic logic programming, repeatedly strong equivalence of logic programs P and Q has been considered, which holds if the programs P ∪ R and Q ∪ R h...
141
click to vote
COMPGEOM
2003
ACM
15 years 10 months ago
2003
ACM
We develop algorithms for computing the smallest enclosing ball of a set of n balls in d-dimensional space. Unlike previous methods, we explicitly address small cases (n ≤ d + 1...
186
click to vote
IPPS
2010
IEEE
15 years 3 months ago
2010
IEEE
Abstract--The now commonplace multi-core chips have introduced, by design, a deep hierarchy of memory and cache banks within parallel computers as a tradeoff between the user frien...