3443 search results - page 474 / 689 » More Algebras for Determiners |
245
click to vote
OOPSLA
2000
Springer
15 years 10 months ago
2000
Springer
Propagation-based call graph construction algorithms have been studied intensively in the 1990s, and differ primarily in the number of sets that are used to approximate run-time v...
184
click to vote
ICFP
1997
ACM
15 years 10 months ago
1997
ACM
An interprocedural flow analysis can justify inlining in higher-order languages. In principle, more inlining can be performed as analysis accuracy improves. This paper compares fo...
175
click to vote
FPCA
1995
15 years 10 months ago
1995
Lenient languages, such as Id90, have been touted as among the best functional languages for massively parallel machines AHN88]. Lenient evaluation combines non-strict semantics w...
184
click to vote
FPGA
1995
ACM
15 years 10 months ago
1995
ACM
Routing FPGAs is a challenging problem because of the relative scarcity of routing resources, both wires and connection points. This can lead either to slow implementations caused...
180
click to vote
ICPP
1995
IEEE
15 years 10 months ago
1995
IEEE
—We propose a unicasting algorithm for faulty hypercubes (including disconnected hypercubes) using the safety level concept. A faulty hypercube is a hypercube with faulty nodes a...