1882 search results - page 178 / 377 » Transformational Programming and Forests |
ICLP
1989
Springer
15 years 2 months ago
1989
Springer
The generation of efficient code for Prolog programs requires sophisticated code transformation and optimization systems. Much of the recent work in this area has focussed on hig...
SAIG
2000
Springer
15 years 1 months ago
2000
Springer
Achieving peak performance in important numerical kernels such as dense matrix multiply or sparse-matrix vector multiplication usually requires extensive, machine-dependent tuning ...
78
Voted
ICALP
2010
Springer
15 years 5 days ago
2010
Springer
Abstract. Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing pro...
171
click to vote
LCTRTS
2011
Springer
14 years 1 months ago
2011
Springer
nguage does not provide any abstractions for exception handling or other forms of error handling, leaving programmers to devise their own conventions for detecting and handling er...
100
click to vote
ICALP
2011
Springer
14 years 1 months ago
2011
Springer
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...