3663 search results - page 577 / 733 » Problems in the ontology of computer programs |
PLILP
1993
Springer
15 years 2 months ago
1993
Springer
Chaotic iteration sequences is a method for approximating fixpoints of monotonic functions proposed by Patrick and Radhia Cousot. It may be used in specialisation algorithms for ...
DAC
2010
ACM
15 years 2 months ago
2010
ACM
—Discrete gate sizing is one of the most commonly used, flexible, and powerful techniques for digital circuit optimization. The underlying problem has been proven to be NP-hard ...
EXPCS
2007
15 years 2 months ago
2007
Measuring the indirect cost of context switch is a challenging problem. In this paper, we show our results of experimentally quantifying the indirect cost of context switch using ...
EUROPAR
2004
Springer
15 years 1 months ago
2004
Springer
Abstract. Modern microprocessors have sacrificed the exactness of exceptions for improved performance long ago. This is a side effect of reordering instructions so that the micropr...
ICS
1995
Tsinghua U.
15 years 1 months ago
1995
Tsinghua U.
The elimination of induction variables and the parallelization of reductions in FORTRAN programs have been shown to be integral to performance improvement on parallel computers 7,...