1071 search results - page 111 / 215 » Programming with enumerable sets of structures |
126
click to vote
SC
2004
ACM
15 years 8 months ago
2004
ACM
Improving program locality has become increasingly important on modern computer systems. An effective strategy is to group computations on the same data so that once the data are ...
130
click to vote
ICCAD
1998
IEEE
15 years 7 months ago
1998
IEEE
- This paper presents an optimal algorithm for solving the problem of simultaneous fanout optimization and routing tree construction for an ordered set of critical sinks. The algor...
125
click to vote
POPL
2010
ACM
16 years 10 days ago
2010
ACM
The automated inference of quantified invariants is considered one of the next challenges in software verification. The question of the right precision-efficiency tradeoff for the...
123
click to vote
EGC
2005
Springer
15 years 8 months ago
2005
Springer
We are concerned with the following problem: How do we allow a community of users to access and process diverse data stored in many different formats? Standard data formats and da...
122
Voted
TLDI
2005
ACM
15 years 8 months ago
2005
ACM
Two different ways of defining ad-hoc polymorphic operations commonly occur in programming languages. With the first form polymorphic operations are defined inductively on the...