203 search results - page 11 / 41 » On Span Programs |
114
click to vote
LCTRTS
2000
Springer
15 years 5 months ago
2000
Springer
This paper presents a general approach to automatically validate code-improving transformations on low-level program representations. The approach ensures the correctness of compi...
141
click to vote
POPL
1993
ACM
15 years 5 months ago
1993
ACM
e data structures are abstractions of simple records and pointers. They impose a shape invariant, which is verified at compiletime and exploited to automatically generate code fo...
123
Voted
ICSE
2009
IEEE-ACM
16 years 2 months ago
2009
IEEE-ACM
Parallelizing existing sequential programs to run efficiently on multicores is hard. The Java 5 package java.util.concurrent (j.u.c.) supports writing concurrent programs: much of...
121
click to vote
STOC
2003
ACM
16 years 2 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
113
click to vote
ATMOS
2007
15 years 3 months ago
2007
Abstract. Approximate dynamic programming offers a new modeling and algorithmic strategy for complex problems such as rail operations. Problems in rail operations are often modeled...